TSTP Solution File: SYN353-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SYN353-1 : TPTP v8.1.2. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 20:30:03 EDT 2023
% Result : Unsatisfiable 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 13
% Syntax : Number of clauses : 53 ( 7 unt; 23 nHn; 34 RR)
% Number of literals : 131 ( 0 equ; 53 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-3 aty)
% Number of variables : 120 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause1,negated_conjecture,
( f(X2,X3,X1)
| f(X3,X1,X2)
| ~ f(X1,X2,X3)
| ~ f(a,a,z(X1,X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.cyeFREYtDy/E---3.1_32531.p',clause1) ).
cnf(clause4,negated_conjecture,
( f(X1,X2,X3)
| f(X3,X2,z(X2,X3,X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.cyeFREYtDy/E---3.1_32531.p',clause4) ).
cnf(clause10,negated_conjecture,
( f(X1,X2,X3)
| f(X2,X3,X1)
| ~ f(z(X2,X3,X1),X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.cyeFREYtDy/E---3.1_32531.p',clause10) ).
cnf(clause6,negated_conjecture,
( f(X3,X1,X2)
| ~ f(X1,X2,X3)
| ~ f(X3,z(X3,X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.cyeFREYtDy/E---3.1_32531.p',clause6) ).
cnf(clause8,negated_conjecture,
( f(X1,X2,X3)
| f(X3,z(X3,X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.cyeFREYtDy/E---3.1_32531.p',clause8) ).
cnf(clause11,negated_conjecture,
( f(X1,X2,X3)
| f(X3,X1,X2)
| ~ f(z(X3,X1,X2),X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.cyeFREYtDy/E---3.1_32531.p',clause11) ).
cnf(clause2,negated_conjecture,
( f(X2,X3,X1)
| ~ f(X1,X2,X3)
| ~ f(X3,X2,z(X2,X3,X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.cyeFREYtDy/E---3.1_32531.p',clause2) ).
cnf(clause12,negated_conjecture,
( f(z(X2,X3,X1),X3,X2)
| ~ f(X1,X2,X3)
| ~ f(X3,X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.cyeFREYtDy/E---3.1_32531.p',clause12) ).
cnf(clause13,negated_conjecture,
( f(z(X1,X2,X3),X2,X1)
| ~ f(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.cyeFREYtDy/E---3.1_32531.p',clause13) ).
cnf(clause3,negated_conjecture,
( f(X3,X1,X2)
| ~ f(X1,X2,X3)
| ~ f(X3,X2,z(X2,X3,X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.cyeFREYtDy/E---3.1_32531.p',clause3) ).
cnf(clause7,negated_conjecture,
( f(X2,X3,X1)
| ~ f(X1,X2,X3)
| ~ f(X3,z(X3,X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.cyeFREYtDy/E---3.1_32531.p',clause7) ).
cnf(clause9,negated_conjecture,
( f(X1,z(X1,X2,X3),X2)
| ~ f(X1,X2,X3)
| ~ f(X3,X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.cyeFREYtDy/E---3.1_32531.p',clause9) ).
cnf(clause17,negated_conjecture,
( ~ f(X1,X2,X3)
| ~ f(X2,X3,X1)
| ~ f(X3,X1,X2)
| ~ f(z(X1,X2,X3),z(X1,X2,X3),z(X1,X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.cyeFREYtDy/E---3.1_32531.p',clause17) ).
cnf(c_0_13,negated_conjecture,
( f(X2,X3,X1)
| f(X3,X1,X2)
| ~ f(X1,X2,X3)
| ~ f(a,a,z(X1,X2,X3)) ),
clause1 ).
cnf(c_0_14,negated_conjecture,
( f(X1,X2,X3)
| f(X3,X2,z(X2,X3,X1)) ),
clause4 ).
cnf(c_0_15,negated_conjecture,
( f(a,X1,a)
| f(X1,a,a)
| ~ f(a,a,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,negated_conjecture,
( f(X1,X2,X3)
| f(X2,X3,X1)
| ~ f(z(X2,X3,X1),X3,X2) ),
clause10 ).
cnf(c_0_17,negated_conjecture,
( f(z(a,a,X1),a,a)
| f(a,z(a,a,X1),a)
| f(X1,a,a) ),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( f(X3,X1,X2)
| ~ f(X1,X2,X3)
| ~ f(X3,z(X3,X1,X2),X1) ),
clause6 ).
cnf(c_0_19,negated_conjecture,
( f(a,z(a,a,X1),a)
| f(X1,a,a)
| f(a,a,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
( f(X1,a,a)
| f(a,a,X1)
| ~ f(a,X1,a) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,negated_conjecture,
( f(X1,X2,X3)
| f(X3,z(X3,X1,X2),X1) ),
clause8 ).
cnf(c_0_22,negated_conjecture,
( f(X1,X2,X3)
| f(X3,X1,X2)
| ~ f(z(X3,X1,X2),X1,X3) ),
clause11 ).
cnf(c_0_23,negated_conjecture,
( f(a,a,z(a,a,X1))
| f(z(a,a,X1),a,a)
| f(a,X1,a) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( f(X2,X3,X1)
| ~ f(X1,X2,X3)
| ~ f(X3,X2,z(X2,X3,X1)) ),
clause2 ).
cnf(c_0_25,negated_conjecture,
( f(a,a,z(a,a,X1))
| f(a,X1,a)
| f(a,a,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
( f(a,X1,a)
| f(a,a,X1)
| ~ f(X1,a,a) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,negated_conjecture,
( f(z(X2,X3,X1),X3,X2)
| ~ f(X1,X2,X3)
| ~ f(X3,X1,X2) ),
clause12 ).
cnf(c_0_28,negated_conjecture,
( f(a,a,z(a,a,X1))
| f(a,z(a,a,X1),a) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_14]),c_0_21]) ).
cnf(c_0_29,negated_conjecture,
( f(a,a,z(a,a,X1))
| f(a,a,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_28]),c_0_25]) ).
cnf(c_0_30,negated_conjecture,
( f(a,a,X1)
| ~ f(X1,a,a) ),
inference(spm,[status(thm)],[c_0_24,c_0_29]) ).
cnf(c_0_31,negated_conjecture,
( f(z(X1,X2,X3),X2,X1)
| ~ f(X1,X2,X3) ),
clause13 ).
cnf(c_0_32,negated_conjecture,
( f(X3,X1,X2)
| ~ f(X1,X2,X3)
| ~ f(X3,X2,z(X2,X3,X1)) ),
clause3 ).
cnf(c_0_33,negated_conjecture,
f(a,a,z(a,a,X1)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_29]) ).
cnf(c_0_34,negated_conjecture,
( f(a,X1,a)
| ~ f(X1,a,a) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,negated_conjecture,
( f(X2,X3,X1)
| ~ f(X1,X2,X3)
| ~ f(X3,z(X3,X1,X2),X1) ),
clause7 ).
cnf(c_0_36,negated_conjecture,
( f(a,z(a,a,X1),a)
| ~ f(a,a,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_31]) ).
cnf(c_0_37,negated_conjecture,
( f(X1,a,a)
| ~ f(a,X1,a) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_20]) ).
cnf(c_0_38,negated_conjecture,
( f(z(a,a,X1),a,a)
| f(a,X1,a) ),
inference(spm,[status(thm)],[c_0_37,c_0_21]) ).
cnf(c_0_39,negated_conjecture,
f(a,z(a,a,X1),a),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_33]),c_0_34]) ).
cnf(c_0_40,negated_conjecture,
( f(a,X1,a)
| f(a,a,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
f(a,a,X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_39]),c_0_40]) ).
cnf(c_0_42,negated_conjecture,
( f(X1,X2,X3)
| f(X2,X3,X1)
| ~ f(X3,X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_41])]) ).
cnf(c_0_43,negated_conjecture,
( f(X1,z(X1,X2,X3),X2)
| f(X2,X1,z(X1,X2,X3)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_27]),c_0_14]),c_0_21]) ).
cnf(c_0_44,negated_conjecture,
( f(X1,z(X1,X2,X3),X2)
| ~ f(X1,X2,X3)
| ~ f(X3,X1,X2) ),
clause9 ).
cnf(c_0_45,negated_conjecture,
( f(X1,z(X1,X2,X3),X2)
| ~ f(X3,X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_43]),c_0_44]) ).
cnf(c_0_46,negated_conjecture,
( f(X1,X2,X3)
| ~ f(X2,X3,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_45]),c_0_42]) ).
cnf(c_0_47,negated_conjecture,
f(X1,X2,z(X2,X1,X3)),
inference(spm,[status(thm)],[c_0_46,c_0_43]) ).
cnf(c_0_48,negated_conjecture,
f(z(X1,X2,X3),X2,X1),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_49,negated_conjecture,
( f(X1,X2,X3)
| ~ f(X3,X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_47])]) ).
cnf(c_0_50,negated_conjecture,
( ~ f(X1,X2,X3)
| ~ f(X2,X3,X1)
| ~ f(X3,X1,X2)
| ~ f(z(X1,X2,X3),z(X1,X2,X3),z(X1,X2,X3)) ),
clause17 ).
cnf(c_0_51,negated_conjecture,
f(X1,X2,X3),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_48])]),c_0_49]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51]),c_0_51]),c_0_51]),c_0_51])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SYN353-1 : TPTP v8.1.2. Released v1.2.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n006.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 : 2400
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Oct 2 18:31:10 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.46 Running first-order model finding
% 0.19/0.46 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.cyeFREYtDy/E---3.1_32531.p
% 0.19/0.48 # Version: 3.1pre001
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48 # Starting sh5l with 300s (1) cores
% 0.19/0.48 # new_bool_3 with pid 32625 completed with status 0
% 0.19/0.48 # Result found by new_bool_3
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48 # Search class: FGHNF-FFMF33-SFFFFFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.48 # SAT001_MinMin_p005000_rr_RG with pid 32633 completed with status 0
% 0.19/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48 # Search class: FGHNF-FFMF33-SFFFFFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.48 # Preprocessing time : 0.001 s
% 0.19/0.48 # Presaturation interreduction done
% 0.19/0.48
% 0.19/0.48 # Proof found!
% 0.19/0.48 # SZS status Unsatisfiable
% 0.19/0.48 # SZS output start CNFRefutation
% See solution above
% 0.19/0.48 # Parsed axioms : 17
% 0.19/0.48 # Removed by relevancy pruning/SinE : 0
% 0.19/0.48 # Initial clauses : 17
% 0.19/0.48 # Removed in clause preprocessing : 0
% 0.19/0.48 # Initial clauses in saturation : 17
% 0.19/0.48 # Processed clauses : 93
% 0.19/0.48 # ...of these trivial : 4
% 0.19/0.48 # ...subsumed : 20
% 0.19/0.48 # ...remaining for further processing : 69
% 0.19/0.48 # Other redundant clauses eliminated : 0
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 25
% 0.19/0.48 # Backward-rewritten : 26
% 0.19/0.48 # Generated clauses : 160
% 0.19/0.48 # ...of the previous two non-redundant : 112
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 13
% 0.19/0.48 # Paramodulations : 158
% 0.19/0.48 # Factorizations : 2
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 0
% 0.19/0.48 # Total rewrite steps : 79
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 1
% 0.19/0.48 # Positive orientable unit clauses : 1
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 0
% 0.19/0.48 # Non-unit-clauses : 0
% 0.19/0.48 # Current number of unprocessed clauses: 35
% 0.19/0.48 # ...number of literals in the above : 94
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 68
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 586
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 497
% 0.19/0.48 # Non-unit clause-clause subsumptions : 45
% 0.19/0.48 # Unit Clause-clause subsumption calls : 40
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 46
% 0.19/0.48 # BW rewrite match successes : 24
% 0.19/0.48 # Condensation attempts : 0
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 2761
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.008 s
% 0.19/0.48 # System time : 0.001 s
% 0.19/0.48 # Total time : 0.009 s
% 0.19/0.48 # Maximum resident set size: 1724 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.009 s
% 0.19/0.48 # System time : 0.003 s
% 0.19/0.48 # Total time : 0.013 s
% 0.19/0.48 # Maximum resident set size: 1732 pages
% 0.19/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------