TSTP Solution File: SYN640-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN640-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:18:01 EDT 2023
% Result : Unsatisfiable 6.02s 1.13s
% Output : CNFRefutation 6.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 34 ( 19 unt; 0 nHn; 30 RR)
% Number of literals : 62 ( 0 equ; 30 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 10 ( 3 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-1 aty)
% Number of variables : 39 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p2_26,negated_conjecture,
( p2(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X3,X2) ),
file('/export/starexec/sandbox/tmp/tmp.icQudzza3p/E---3.1_26350.p',p2_26) ).
cnf(p2_5,negated_conjecture,
p2(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.icQudzza3p/E---3.1_26350.p',p2_5) ).
cnf(p2_34,negated_conjecture,
p2(f13(f11(c25)),f7(f8(f9(f8(f9(f9(f9(f9(f8(c24)))))))))),
file('/export/starexec/sandbox/tmp/tmp.icQudzza3p/E---3.1_26350.p',p2_34) ).
cnf(p2_18,negated_conjecture,
( p2(f13(X1),f13(X2))
| ~ p4(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.icQudzza3p/E---3.1_26350.p',p2_18) ).
cnf(p2_33,negated_conjecture,
p2(f13(f11(c23)),f7(f8(f9(f8(f9(f9(f9(f9(f8(c24)))))))))),
file('/export/starexec/sandbox/tmp/tmp.icQudzza3p/E---3.1_26350.p',p2_33) ).
cnf(p19_28,negated_conjecture,
( p19(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X4,X2)
| ~ p19(X3,X4) ),
file('/export/starexec/sandbox/tmp/tmp.icQudzza3p/E---3.1_26350.p',p19_28) ).
cnf(p19_12,negated_conjecture,
p19(f13(f11(c23)),f13(f11(c22))),
file('/export/starexec/sandbox/tmp/tmp.icQudzza3p/E---3.1_26350.p',p19_12) ).
cnf(p4_3,negated_conjecture,
p4(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.icQudzza3p/E---3.1_26350.p',p4_3) ).
cnf(p20_35,negated_conjecture,
( p20(f17(X1),f17(X2))
| ~ p2(f12(f11(X2)),f7(c24))
| ~ p2(f12(f11(X1)),f7(c24))
| ~ p19(f13(f11(X1)),f13(f11(X2))) ),
file('/export/starexec/sandbox/tmp/tmp.icQudzza3p/E---3.1_26350.p',p20_35) ).
cnf(p2_10,negated_conjecture,
p2(f12(f11(c22)),f7(c24)),
file('/export/starexec/sandbox/tmp/tmp.icQudzza3p/E---3.1_26350.p',p2_10) ).
cnf(p2_9,negated_conjecture,
p2(f12(f11(c25)),f7(c24)),
file('/export/starexec/sandbox/tmp/tmp.icQudzza3p/E---3.1_26350.p',p2_9) ).
cnf(not_p20_7,negated_conjecture,
~ p20(f17(c25),f17(c22)),
file('/export/starexec/sandbox/tmp/tmp.icQudzza3p/E---3.1_26350.p',not_p20_7) ).
cnf(c_0_12,negated_conjecture,
( p2(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X3,X2) ),
p2_26 ).
cnf(c_0_13,negated_conjecture,
p2(X1,X1),
p2_5 ).
cnf(c_0_14,negated_conjecture,
( p2(X1,X2)
| ~ p2(X2,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,negated_conjecture,
p2(f13(f11(c25)),f7(f8(f9(f8(f9(f9(f9(f9(f8(c24)))))))))),
p2_34 ).
cnf(c_0_16,negated_conjecture,
( p2(f13(X1),f13(X2))
| ~ p4(X1,X2) ),
p2_18 ).
cnf(c_0_17,negated_conjecture,
p2(f7(f8(f9(f8(f9(f9(f9(f9(f8(c24))))))))),f13(f11(c25))),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
( p2(X1,f13(X2))
| ~ p2(f13(X3),X1)
| ~ p4(X3,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
p2(f13(f11(c23)),f7(f8(f9(f8(f9(f9(f9(f9(f8(c24)))))))))),
p2_33 ).
cnf(c_0_20,negated_conjecture,
( p19(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X4,X2)
| ~ p19(X3,X4) ),
p19_28 ).
cnf(c_0_21,negated_conjecture,
( p2(X1,f13(f11(c25)))
| ~ p2(f7(f8(f9(f8(f9(f9(f9(f9(f8(c24))))))))),X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( p2(f7(f8(f9(f8(f9(f9(f9(f9(f8(c24))))))))),f13(X1))
| ~ p4(f11(c23),X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
( p19(X1,X2)
| ~ p19(X3,X2)
| ~ p2(X3,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_13]) ).
cnf(c_0_24,negated_conjecture,
( p2(f13(X1),f13(f11(c25)))
| ~ p4(f11(c23),X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
( p19(f13(f11(c25)),X1)
| ~ p19(f13(X2),X1)
| ~ p4(f11(c23),X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,negated_conjecture,
p19(f13(f11(c23)),f13(f11(c22))),
p19_12 ).
cnf(c_0_27,negated_conjecture,
p4(X1,X1),
p4_3 ).
cnf(c_0_28,negated_conjecture,
( p20(f17(X1),f17(X2))
| ~ p2(f12(f11(X2)),f7(c24))
| ~ p2(f12(f11(X1)),f7(c24))
| ~ p19(f13(f11(X1)),f13(f11(X2))) ),
p20_35 ).
cnf(c_0_29,negated_conjecture,
p19(f13(f11(c25)),f13(f11(c22))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_30,negated_conjecture,
p2(f12(f11(c22)),f7(c24)),
p2_10 ).
cnf(c_0_31,negated_conjecture,
p2(f12(f11(c25)),f7(c24)),
p2_9 ).
cnf(c_0_32,negated_conjecture,
~ p20(f17(c25),f17(c22)),
not_p20_7 ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31])]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.07 % Problem : SYN640-1 : TPTP v8.1.2. Released v2.5.0.
% 0.03/0.08 % Command : run_E %s %d THM
% 0.07/0.26 % Computer : n013.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 2400
% 0.07/0.26 % WCLimit : 300
% 0.07/0.26 % DateTime : Mon Oct 2 18:19:59 EDT 2023
% 0.07/0.26 % CPUTime :
% 0.11/0.33 Running first-order theorem proving
% 0.11/0.33 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.icQudzza3p/E---3.1_26350.p
% 6.02/1.13 # Version: 3.1pre001
% 6.02/1.13 # Preprocessing class: FSMSSMSSSSSNFFN.
% 6.02/1.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.02/1.13 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.02/1.13 # Starting new_bool_3 with 300s (1) cores
% 6.02/1.13 # Starting new_bool_1 with 300s (1) cores
% 6.02/1.13 # Starting sh5l with 300s (1) cores
% 6.02/1.13 # new_bool_1 with pid 26430 completed with status 0
% 6.02/1.13 # Result found by new_bool_1
% 6.02/1.13 # Preprocessing class: FSMSSMSSSSSNFFN.
% 6.02/1.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.02/1.13 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.02/1.13 # Starting new_bool_3 with 300s (1) cores
% 6.02/1.13 # Starting new_bool_1 with 300s (1) cores
% 6.02/1.13 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 6.02/1.13 # Search class: FHUNM-FFMM21-DFFFFFNN
% 6.02/1.13 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 6.02/1.13 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 6.02/1.13 # SAT001_MinMin_p005000_rr_RG with pid 26438 completed with status 0
% 6.02/1.13 # Result found by SAT001_MinMin_p005000_rr_RG
% 6.02/1.13 # Preprocessing class: FSMSSMSSSSSNFFN.
% 6.02/1.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.02/1.13 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.02/1.13 # Starting new_bool_3 with 300s (1) cores
% 6.02/1.13 # Starting new_bool_1 with 300s (1) cores
% 6.02/1.13 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 6.02/1.13 # Search class: FHUNM-FFMM21-DFFFFFNN
% 6.02/1.13 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 6.02/1.13 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 6.02/1.13 # Preprocessing time : 0.001 s
% 6.02/1.13 # Presaturation interreduction done
% 6.02/1.13
% 6.02/1.13 # Proof found!
% 6.02/1.13 # SZS status Unsatisfiable
% 6.02/1.13 # SZS output start CNFRefutation
% See solution above
% 6.02/1.13 # Parsed axioms : 42
% 6.02/1.13 # Removed by relevancy pruning/SinE : 0
% 6.02/1.13 # Initial clauses : 42
% 6.02/1.13 # Removed in clause preprocessing : 0
% 6.02/1.13 # Initial clauses in saturation : 42
% 6.02/1.13 # Processed clauses : 11925
% 6.02/1.13 # ...of these trivial : 138
% 6.02/1.13 # ...subsumed : 8948
% 6.02/1.13 # ...remaining for further processing : 2839
% 6.02/1.13 # Other redundant clauses eliminated : 0
% 6.02/1.13 # Clauses deleted for lack of memory : 0
% 6.02/1.13 # Backward-subsumed : 24
% 6.02/1.13 # Backward-rewritten : 0
% 6.02/1.13 # Generated clauses : 80590
% 6.02/1.13 # ...of the previous two non-redundant : 72939
% 6.02/1.13 # ...aggressively subsumed : 0
% 6.02/1.13 # Contextual simplify-reflections : 2
% 6.02/1.13 # Paramodulations : 80590
% 6.02/1.13 # Factorizations : 0
% 6.02/1.13 # NegExts : 0
% 6.02/1.13 # Equation resolutions : 0
% 6.02/1.13 # Total rewrite steps : 15167
% 6.02/1.13 # Propositional unsat checks : 0
% 6.02/1.13 # Propositional check models : 0
% 6.02/1.13 # Propositional check unsatisfiable : 0
% 6.02/1.13 # Propositional clauses : 0
% 6.02/1.13 # Propositional clauses after purity: 0
% 6.02/1.13 # Propositional unsat core size : 0
% 6.02/1.13 # Propositional preprocessing time : 0.000
% 6.02/1.13 # Propositional encoding time : 0.000
% 6.02/1.13 # Propositional solver time : 0.000
% 6.02/1.13 # Success case prop preproc time : 0.000
% 6.02/1.13 # Success case prop encoding time : 0.000
% 6.02/1.13 # Success case prop solver time : 0.000
% 6.02/1.13 # Current number of processed clauses : 2773
% 6.02/1.13 # Positive orientable unit clauses : 169
% 6.02/1.13 # Positive unorientable unit clauses: 0
% 6.02/1.13 # Negative unit clauses : 42
% 6.02/1.13 # Non-unit-clauses : 2562
% 6.02/1.13 # Current number of unprocessed clauses: 61049
% 6.02/1.13 # ...number of literals in the above : 191322
% 6.02/1.13 # Current number of archived formulas : 0
% 6.02/1.13 # Current number of archived clauses : 66
% 6.02/1.13 # Clause-clause subsumption calls (NU) : 587937
% 6.02/1.13 # Rec. Clause-clause subsumption calls : 508908
% 6.02/1.13 # Non-unit clause-clause subsumptions : 6837
% 6.02/1.13 # Unit Clause-clause subsumption calls : 4128
% 6.02/1.13 # Rewrite failures with RHS unbound : 0
% 6.02/1.13 # BW rewrite match attempts : 533
% 6.02/1.13 # BW rewrite match successes : 0
% 6.02/1.13 # Condensation attempts : 0
% 6.02/1.13 # Condensation successes : 0
% 6.02/1.13 # Termbank termtop insertions : 1447616
% 6.02/1.13
% 6.02/1.13 # -------------------------------------------------
% 6.02/1.13 # User time : 0.767 s
% 6.02/1.13 # System time : 0.025 s
% 6.02/1.13 # Total time : 0.792 s
% 6.02/1.13 # Maximum resident set size: 1804 pages
% 6.02/1.13
% 6.02/1.13 # -------------------------------------------------
% 6.02/1.13 # User time : 0.769 s
% 6.02/1.13 # System time : 0.025 s
% 6.02/1.13 # Total time : 0.794 s
% 6.02/1.13 # Maximum resident set size: 1744 pages
% 6.02/1.13 % E---3.1 exiting
% 6.02/1.13 % E---3.1 exiting
%------------------------------------------------------------------------------