TSTP Solution File: SYN075-1 by E-SAT---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.2.0
% Problem : SYN075-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d SAT
% Computer : n021.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Jun 24 19:22:53 EDT 2024
% Result : Unsatisfiable 0.79s 1.01s
% Output : CNFRefutation 0.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of clauses : 27 ( 4 unt; 8 nHn; 21 RR)
% Number of literals : 65 ( 40 equ; 35 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 47 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_4,negated_conjecture,
( f(X2) = X2
| ~ big_f(X1,f(X2))
| X1 != g(X2) ),
file('/export/starexec/sandbox/tmp/tmp.WBGewS2ZF2/E---3.1_924.p',clause_4) ).
cnf(clause_6,negated_conjecture,
( big_f(X1,f(X2))
| f(X2) = X2
| X1 != g(X2) ),
file('/export/starexec/sandbox/tmp/tmp.WBGewS2ZF2/E---3.1_924.p',clause_6) ).
cnf(clause_9,negated_conjecture,
( big_f(h(X1,X2),f(X1))
| h(X1,X2) = X2
| f(X1) != X1 ),
file('/export/starexec/sandbox/tmp/tmp.WBGewS2ZF2/E---3.1_924.p',clause_9) ).
cnf(clause_10,negated_conjecture,
( f(X1) != X1
| h(X1,X2) != X2
| ~ big_f(h(X1,X2),f(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.WBGewS2ZF2/E---3.1_924.p',clause_10) ).
cnf(clause_1,axiom,
( X1 = a
| ~ big_f(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.WBGewS2ZF2/E---3.1_924.p',clause_1) ).
cnf(clause_3,axiom,
( big_f(X1,X2)
| X1 != a
| X2 != b ),
file('/export/starexec/sandbox/tmp/tmp.WBGewS2ZF2/E---3.1_924.p',clause_3) ).
cnf(c_0_6,negated_conjecture,
( f(X2) = X2
| ~ big_f(X1,f(X2))
| X1 != g(X2) ),
inference(fof_simplification,[status(thm)],[clause_4]) ).
cnf(c_0_7,negated_conjecture,
( big_f(X1,f(X2))
| f(X2) = X2
| X1 != g(X2) ),
inference(fof_simplification,[status(thm)],[clause_6]) ).
cnf(c_0_8,negated_conjecture,
( f(X2) = X2
| ~ big_f(X1,f(X2))
| X1 != g(X2) ),
c_0_6 ).
cnf(c_0_9,negated_conjecture,
( big_f(h(X1,X2),f(X1))
| h(X1,X2) = X2
| f(X1) != X1 ),
inference(fof_simplification,[status(thm)],[clause_9]) ).
cnf(c_0_10,negated_conjecture,
( big_f(X1,f(X2))
| f(X2) = X2
| X1 != g(X2) ),
c_0_7 ).
cnf(c_0_11,negated_conjecture,
( f(X1) = X1
| ~ big_f(g(X1),f(X1)) ),
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( f(X1) != X1
| h(X1,X2) != X2
| ~ big_f(h(X1,X2),f(X1)) ),
inference(fof_simplification,[status(thm)],[clause_10]) ).
cnf(c_0_13,plain,
( X1 = a
| ~ big_f(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause_1]) ).
cnf(c_0_14,negated_conjecture,
( big_f(h(X1,X2),f(X1))
| h(X1,X2) = X2
| f(X1) != X1 ),
c_0_9 ).
cnf(c_0_15,negated_conjecture,
f(X1) = X1,
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_10]),c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( f(X1) != X1
| h(X1,X2) != X2
| ~ big_f(h(X1,X2),f(X1)) ),
c_0_12 ).
cnf(c_0_17,plain,
( X1 = a
| ~ big_f(X1,X2) ),
c_0_13 ).
cnf(c_0_18,negated_conjecture,
( h(X1,X2) = X2
| big_f(h(X1,X2),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15])]) ).
cnf(c_0_19,plain,
( big_f(X1,X2)
| X1 != a
| X2 != b ),
inference(fof_simplification,[status(thm)],[clause_3]) ).
cnf(c_0_20,negated_conjecture,
( h(X1,X2) != X2
| ~ big_f(h(X1,X2),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_15]),c_0_15])]) ).
cnf(c_0_21,negated_conjecture,
( h(X1,X2) = a
| h(X1,X2) = X2 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( big_f(X1,X2)
| X1 != a
| X2 != b ),
c_0_19 ).
cnf(c_0_23,negated_conjecture,
( h(X1,X2) = a
| ~ big_f(X2,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
big_f(a,b),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_22])]) ).
cnf(c_0_25,negated_conjecture,
~ big_f(a,X1),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_23])]) ).
cnf(c_0_26,plain,
$false,
inference(sr,[status(thm)],[c_0_24,c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : SYN075-1 : TPTP v8.2.0. Released v1.0.0.
% 0.10/0.13 % Command : run_E %s %d SAT
% 0.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun Jun 23 22:53:54 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.22/0.49 Running first-order model finding
% 0.22/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.WBGewS2ZF2/E---3.1_924.p
% 0.79/1.01 # Version: 3.2.0
% 0.79/1.01 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.79/1.01 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.79/1.01 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.79/1.01 # Starting new_bool_3 with 300s (1) cores
% 0.79/1.01 # Starting new_bool_1 with 300s (1) cores
% 0.79/1.01 # Starting sh5l with 300s (1) cores
% 0.79/1.01 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1058 completed with status 0
% 0.79/1.01 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.79/1.01 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.79/1.01 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.79/1.01 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.79/1.01 # No SInE strategy applied
% 0.79/1.01 # Search class: FGHSF-FFSF21-SFFFFFNN
% 0.79/1.01 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.79/1.01 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.79/1.01 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.79/1.01 # Starting new_bool_3 with 136s (1) cores
% 0.79/1.01 # Starting new_bool_1 with 136s (1) cores
% 0.79/1.01 # Starting sh5l with 136s (1) cores
% 0.79/1.01 # SAT001_MinMin_p005000_rr_RG with pid 1066 completed with status 0
% 0.79/1.01 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.79/1.01 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.79/1.01 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.79/1.01 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.79/1.01 # No SInE strategy applied
% 0.79/1.01 # Search class: FGHSF-FFSF21-SFFFFFNN
% 0.79/1.01 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.79/1.01 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.79/1.01 # Preprocessing time : 0.001 s
% 0.79/1.01 # Presaturation interreduction done
% 0.79/1.01
% 0.79/1.01 # Proof found!
% 0.79/1.01 # SZS status Unsatisfiable
% 0.79/1.01 # SZS output start CNFRefutation
% See solution above
% 0.79/1.01 # Parsed axioms : 10
% 0.79/1.01 # Removed by relevancy pruning/SinE : 0
% 0.79/1.01 # Initial clauses : 10
% 0.79/1.01 # Removed in clause preprocessing : 1
% 0.79/1.01 # Initial clauses in saturation : 9
% 0.79/1.01 # Processed clauses : 24
% 0.79/1.01 # ...of these trivial : 0
% 0.79/1.01 # ...subsumed : 3
% 0.79/1.01 # ...remaining for further processing : 21
% 0.79/1.01 # Other redundant clauses eliminated : 8
% 0.79/1.01 # Clauses deleted for lack of memory : 0
% 0.79/1.01 # Backward-subsumed : 0
% 0.79/1.01 # Backward-rewritten : 2
% 0.79/1.01 # Generated clauses : 21
% 0.79/1.01 # ...of the previous two non-redundant : 16
% 0.79/1.01 # ...aggressively subsumed : 0
% 0.79/1.01 # Contextual simplify-reflections : 1
% 0.79/1.01 # Paramodulations : 11
% 0.79/1.01 # Factorizations : 2
% 0.79/1.01 # NegExts : 0
% 0.79/1.01 # Equation resolutions : 8
% 0.79/1.01 # Disequality decompositions : 0
% 0.79/1.01 # Total rewrite steps : 10
% 0.79/1.01 # ...of those cached : 8
% 0.79/1.01 # Propositional unsat checks : 0
% 0.79/1.01 # Propositional check models : 0
% 0.79/1.01 # Propositional check unsatisfiable : 0
% 0.79/1.01 # Propositional clauses : 0
% 0.79/1.01 # Propositional clauses after purity: 0
% 0.79/1.01 # Propositional unsat core size : 0
% 0.79/1.01 # Propositional preprocessing time : 0.000
% 0.79/1.01 # Propositional encoding time : 0.000
% 0.79/1.01 # Propositional solver time : 0.000
% 0.79/1.01 # Success case prop preproc time : 0.000
% 0.79/1.01 # Success case prop encoding time : 0.000
% 0.79/1.01 # Success case prop solver time : 0.000
% 0.79/1.01 # Current number of processed clauses : 9
% 0.79/1.01 # Positive orientable unit clauses : 1
% 0.79/1.01 # Positive unorientable unit clauses: 0
% 0.79/1.01 # Negative unit clauses : 1
% 0.79/1.01 # Non-unit-clauses : 7
% 0.79/1.01 # Current number of unprocessed clauses: 7
% 0.79/1.01 # ...number of literals in the above : 16
% 0.79/1.01 # Current number of archived formulas : 0
% 0.79/1.01 # Current number of archived clauses : 9
% 0.79/1.01 # Clause-clause subsumption calls (NU) : 6
% 0.79/1.01 # Rec. Clause-clause subsumption calls : 6
% 0.79/1.01 # Non-unit clause-clause subsumptions : 4
% 0.79/1.01 # Unit Clause-clause subsumption calls : 0
% 0.79/1.01 # Rewrite failures with RHS unbound : 0
% 0.79/1.01 # BW rewrite match attempts : 1
% 0.79/1.01 # BW rewrite match successes : 1
% 0.79/1.01 # Condensation attempts : 0
% 0.79/1.01 # Condensation successes : 0
% 0.79/1.01 # Termbank termtop insertions : 437
% 0.79/1.01 # Search garbage collected termcells : 27
% 0.79/1.01
% 0.79/1.01 # -------------------------------------------------
% 0.79/1.01 # User time : 0.004 s
% 0.79/1.01 # System time : 0.002 s
% 0.79/1.01 # Total time : 0.005 s
% 0.79/1.01 # Maximum resident set size: 1608 pages
% 0.79/1.01
% 0.79/1.01 # -------------------------------------------------
% 0.79/1.01 # User time : 0.013 s
% 0.79/1.01 # System time : 0.006 s
% 0.79/1.01 # Total time : 0.019 s
% 0.79/1.01 # Maximum resident set size: 1696 pages
% 0.79/1.01 % E---3.1 exiting
% 0.79/1.01 % E exiting
%------------------------------------------------------------------------------