TSTP Solution File: SYN690-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN690-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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 : Sat May 4 10:10:05 EDT 2024
% Result : Unsatisfiable 0.21s 0.55s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of clauses : 34 ( 13 unt; 7 nHn; 25 RR)
% Number of literals : 84 ( 0 equ; 46 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 24 ( 24 usr; 10 con; 0-2 aty)
% Number of variables : 71 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p4_27,negated_conjecture,
( p4(X1,X2)
| ~ p4(X3,X1)
| ~ p4(X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.H6m5kO7Enf/E---3.1_11484.p',p4_27) ).
cnf(p2_61,negated_conjecture,
( p2(X1,X2)
| p4(f5(f26(f28(c43,X3),X4),X5),f5(f26(f28(c44,X3),X4),X5))
| ~ p34(c36,X3)
| ~ p35(f10(X3,X5),f30(f32(c42,X3),X4))
| ~ p4(f5(X1,f18(f20(f22(f24(c45,X3),X4),X1),X2)),f5(f7(X4,X1),f18(f20(f22(f24(c45,X3),X4),X1),X2)))
| ~ p4(f5(X2,f18(f20(f22(f24(c45,X3),X4),X1),X2)),f5(f7(X4,X2),f18(f20(f22(f24(c45,X3),X4),X1),X2))) ),
file('/export/starexec/sandbox2/tmp/tmp.H6m5kO7Enf/E---3.1_11484.p',p2_61) ).
cnf(p4_21,negated_conjecture,
p4(f5(c40,X1),f5(f7(c39,c40),X1)),
file('/export/starexec/sandbox2/tmp/tmp.H6m5kO7Enf/E---3.1_11484.p',p4_21) ).
cnf(p4_5,negated_conjecture,
p4(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.H6m5kO7Enf/E---3.1_11484.p',p4_5) ).
cnf(p4_22,negated_conjecture,
p4(f5(c38,X1),f5(f7(c39,c38),X1)),
file('/export/starexec/sandbox2/tmp/tmp.H6m5kO7Enf/E---3.1_11484.p',p4_22) ).
cnf(not_p2_20,negated_conjecture,
~ p2(c38,c40),
file('/export/starexec/sandbox2/tmp/tmp.H6m5kO7Enf/E---3.1_11484.p',not_p2_20) ).
cnf(p4_58,negated_conjecture,
( p4(f5(f7(c39,X1),X2),f5(f7(c39,X3),X2))
| ~ p4(f5(X1,f12(f14(f16(c41,X1),X3),X2)),f5(X3,f12(f14(f16(c41,X1),X3),X2))) ),
file('/export/starexec/sandbox2/tmp/tmp.H6m5kO7Enf/E---3.1_11484.p',p4_58) ).
cnf(p4_57,negated_conjecture,
( p4(f5(f7(c39,X1),X2),f5(f7(c39,X3),X2))
| p35(f10(c37,f12(f14(f16(c41,X1),X3),X2)),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.H6m5kO7Enf/E---3.1_11484.p',p4_57) ).
cnf(p34_19,negated_conjecture,
p34(c36,c37),
file('/export/starexec/sandbox2/tmp/tmp.H6m5kO7Enf/E---3.1_11484.p',p34_19) ).
cnf(p2_62,negated_conjecture,
( p2(X1,X2)
| ~ p34(c36,X3)
| ~ p4(f5(X1,f18(f20(f22(f24(c45,X3),X4),X1),X2)),f5(f7(X4,X1),f18(f20(f22(f24(c45,X3),X4),X1),X2)))
| ~ p4(f5(X2,f18(f20(f22(f24(c45,X3),X4),X1),X2)),f5(f7(X4,X2),f18(f20(f22(f24(c45,X3),X4),X1),X2)))
| ~ p4(f5(f7(X4,f26(f28(c43,X3),X4)),f30(f32(c42,X3),X4)),f5(f7(X4,f26(f28(c44,X3),X4)),f30(f32(c42,X3),X4))) ),
file('/export/starexec/sandbox2/tmp/tmp.H6m5kO7Enf/E---3.1_11484.p',p2_62) ).
cnf(c_0_10,negated_conjecture,
( p4(X1,X2)
| ~ p4(X3,X1)
| ~ p4(X3,X2) ),
inference(fof_simplification,[status(thm)],[p4_27]) ).
cnf(c_0_11,negated_conjecture,
( p2(X1,X2)
| p4(f5(f26(f28(c43,X3),X4),X5),f5(f26(f28(c44,X3),X4),X5))
| ~ p34(c36,X3)
| ~ p35(f10(X3,X5),f30(f32(c42,X3),X4))
| ~ p4(f5(X1,f18(f20(f22(f24(c45,X3),X4),X1),X2)),f5(f7(X4,X1),f18(f20(f22(f24(c45,X3),X4),X1),X2)))
| ~ p4(f5(X2,f18(f20(f22(f24(c45,X3),X4),X1),X2)),f5(f7(X4,X2),f18(f20(f22(f24(c45,X3),X4),X1),X2))) ),
inference(fof_simplification,[status(thm)],[p2_61]) ).
cnf(c_0_12,negated_conjecture,
( p4(X1,X2)
| ~ p4(X3,X1)
| ~ p4(X3,X2) ),
c_0_10 ).
cnf(c_0_13,negated_conjecture,
p4(f5(c40,X1),f5(f7(c39,c40),X1)),
p4_21 ).
cnf(c_0_14,negated_conjecture,
( p2(X1,X2)
| p4(f5(f26(f28(c43,X3),X4),X5),f5(f26(f28(c44,X3),X4),X5))
| ~ p34(c36,X3)
| ~ p35(f10(X3,X5),f30(f32(c42,X3),X4))
| ~ p4(f5(X1,f18(f20(f22(f24(c45,X3),X4),X1),X2)),f5(f7(X4,X1),f18(f20(f22(f24(c45,X3),X4),X1),X2)))
| ~ p4(f5(X2,f18(f20(f22(f24(c45,X3),X4),X1),X2)),f5(f7(X4,X2),f18(f20(f22(f24(c45,X3),X4),X1),X2))) ),
c_0_11 ).
cnf(c_0_15,negated_conjecture,
( p4(X1,f5(f7(c39,c40),X2))
| ~ p4(f5(c40,X2),X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
p4(X1,X1),
p4_5 ).
cnf(c_0_17,negated_conjecture,
p4(f5(c38,X1),f5(f7(c39,c38),X1)),
p4_22 ).
cnf(c_0_18,negated_conjecture,
~ p2(c38,c40),
inference(fof_simplification,[status(thm)],[not_p2_20]) ).
cnf(c_0_19,negated_conjecture,
( p2(X1,c40)
| p4(f5(f26(f28(c43,X2),c39),X3),f5(f26(f28(c44,X2),c39),X3))
| ~ p35(f10(X2,X3),f30(f32(c42,X2),c39))
| ~ p34(c36,X2)
| ~ p4(f5(X1,f18(f20(f22(f24(c45,X2),c39),X1),c40)),f5(f7(c39,X1),f18(f20(f22(f24(c45,X2),c39),X1),c40))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_20,negated_conjecture,
( p4(X1,f5(f7(c39,c38),X2))
| ~ p4(f5(c38,X2),X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
~ p2(c38,c40),
c_0_18 ).
cnf(c_0_22,negated_conjecture,
( p4(f5(f7(c39,X1),X2),f5(f7(c39,X3),X2))
| ~ p4(f5(X1,f12(f14(f16(c41,X1),X3),X2)),f5(X3,f12(f14(f16(c41,X1),X3),X2))) ),
inference(fof_simplification,[status(thm)],[p4_58]) ).
cnf(c_0_23,negated_conjecture,
( p4(f5(f26(f28(c43,X1),c39),X2),f5(f26(f28(c44,X1),c39),X2))
| ~ p35(f10(X1,X2),f30(f32(c42,X1),c39))
| ~ p34(c36,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_16])]),c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( p4(f5(f7(c39,X1),X2),f5(f7(c39,X3),X2))
| p35(f10(c37,f12(f14(f16(c41,X1),X3),X2)),X2) ),
p4_57 ).
cnf(c_0_25,negated_conjecture,
p34(c36,c37),
p34_19 ).
cnf(c_0_26,negated_conjecture,
( p2(X1,X2)
| ~ p34(c36,X3)
| ~ p4(f5(X1,f18(f20(f22(f24(c45,X3),X4),X1),X2)),f5(f7(X4,X1),f18(f20(f22(f24(c45,X3),X4),X1),X2)))
| ~ p4(f5(X2,f18(f20(f22(f24(c45,X3),X4),X1),X2)),f5(f7(X4,X2),f18(f20(f22(f24(c45,X3),X4),X1),X2)))
| ~ p4(f5(f7(X4,f26(f28(c43,X3),X4)),f30(f32(c42,X3),X4)),f5(f7(X4,f26(f28(c44,X3),X4)),f30(f32(c42,X3),X4))) ),
inference(fof_simplification,[status(thm)],[p2_62]) ).
cnf(c_0_27,negated_conjecture,
( p4(f5(f7(c39,X1),X2),f5(f7(c39,X3),X2))
| ~ p4(f5(X1,f12(f14(f16(c41,X1),X3),X2)),f5(X3,f12(f14(f16(c41,X1),X3),X2))) ),
c_0_22 ).
cnf(c_0_28,negated_conjecture,
( p4(f5(f26(f28(c43,c37),c39),f12(f14(f16(c41,X1),X2),f30(f32(c42,c37),c39))),f5(f26(f28(c44,c37),c39),f12(f14(f16(c41,X1),X2),f30(f32(c42,c37),c39))))
| p4(f5(f7(c39,X1),f30(f32(c42,c37),c39)),f5(f7(c39,X2),f30(f32(c42,c37),c39))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_29,negated_conjecture,
( p2(X1,X2)
| ~ p34(c36,X3)
| ~ p4(f5(X1,f18(f20(f22(f24(c45,X3),X4),X1),X2)),f5(f7(X4,X1),f18(f20(f22(f24(c45,X3),X4),X1),X2)))
| ~ p4(f5(X2,f18(f20(f22(f24(c45,X3),X4),X1),X2)),f5(f7(X4,X2),f18(f20(f22(f24(c45,X3),X4),X1),X2)))
| ~ p4(f5(f7(X4,f26(f28(c43,X3),X4)),f30(f32(c42,X3),X4)),f5(f7(X4,f26(f28(c44,X3),X4)),f30(f32(c42,X3),X4))) ),
c_0_26 ).
cnf(c_0_30,negated_conjecture,
p4(f5(f7(c39,f26(f28(c43,c37),c39)),f30(f32(c42,c37),c39)),f5(f7(c39,f26(f28(c44,c37),c39)),f30(f32(c42,c37),c39))),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
( p2(X1,X2)
| ~ p4(f5(X2,f18(f20(f22(f24(c45,c37),c39),X1),X2)),f5(f7(c39,X2),f18(f20(f22(f24(c45,c37),c39),X1),X2)))
| ~ p4(f5(X1,f18(f20(f22(f24(c45,c37),c39),X1),X2)),f5(f7(c39,X1),f18(f20(f22(f24(c45,c37),c39),X1),X2))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_25])]) ).
cnf(c_0_32,negated_conjecture,
( p2(X1,c40)
| ~ p4(f5(X1,f18(f20(f22(f24(c45,c37),c39),X1),c40)),f5(f7(c39,X1),f18(f20(f22(f24(c45,c37),c39),X1),c40))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_15]),c_0_16])]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_20]),c_0_16])]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SYN690-1 : TPTP v8.1.2. Released v2.5.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n003.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 11:06:35 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.H6m5kO7Enf/E---3.1_11484.p
% 0.21/0.55 # Version: 3.1.0
% 0.21/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.55 # Starting sh5l with 300s (1) cores
% 0.21/0.55 # new_bool_1 with pid 11565 completed with status 0
% 0.21/0.55 # Result found by new_bool_1
% 0.21/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.55 # Search class: FGUNM-FFMF22-MFFFFFNN
% 0.21/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.55 # SAT001_MinMin_p005000_rr_RG with pid 11571 completed with status 0
% 0.21/0.55 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.55 # Search class: FGUNM-FFMF22-MFFFFFNN
% 0.21/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.55 # Preprocessing time : 0.003 s
% 0.21/0.55 # Presaturation interreduction done
% 0.21/0.55
% 0.21/0.55 # Proof found!
% 0.21/0.55 # SZS status Unsatisfiable
% 0.21/0.55 # SZS output start CNFRefutation
% See solution above
% 0.21/0.55 # Parsed axioms : 62
% 0.21/0.55 # Removed by relevancy pruning/SinE : 0
% 0.21/0.55 # Initial clauses : 62
% 0.21/0.55 # Removed in clause preprocessing : 0
% 0.21/0.55 # Initial clauses in saturation : 62
% 0.21/0.55 # Processed clauses : 459
% 0.21/0.55 # ...of these trivial : 4
% 0.21/0.55 # ...subsumed : 80
% 0.21/0.55 # ...remaining for further processing : 375
% 0.21/0.55 # Other redundant clauses eliminated : 0
% 0.21/0.55 # Clauses deleted for lack of memory : 0
% 0.21/0.55 # Backward-subsumed : 4
% 0.21/0.55 # Backward-rewritten : 0
% 0.21/0.55 # Generated clauses : 1514
% 0.21/0.55 # ...of the previous two non-redundant : 1284
% 0.21/0.55 # ...aggressively subsumed : 0
% 0.21/0.55 # Contextual simplify-reflections : 0
% 0.21/0.55 # Paramodulations : 1514
% 0.21/0.55 # Factorizations : 0
% 0.21/0.55 # NegExts : 0
% 0.21/0.55 # Equation resolutions : 0
% 0.21/0.55 # Disequality decompositions : 0
% 0.21/0.55 # Total rewrite steps : 309
% 0.21/0.55 # ...of those cached : 223
% 0.21/0.55 # Propositional unsat checks : 0
% 0.21/0.55 # Propositional check models : 0
% 0.21/0.55 # Propositional check unsatisfiable : 0
% 0.21/0.55 # Propositional clauses : 0
% 0.21/0.55 # Propositional clauses after purity: 0
% 0.21/0.55 # Propositional unsat core size : 0
% 0.21/0.55 # Propositional preprocessing time : 0.000
% 0.21/0.55 # Propositional encoding time : 0.000
% 0.21/0.55 # Propositional solver time : 0.000
% 0.21/0.55 # Success case prop preproc time : 0.000
% 0.21/0.55 # Success case prop encoding time : 0.000
% 0.21/0.55 # Success case prop solver time : 0.000
% 0.21/0.55 # Current number of processed clauses : 309
% 0.21/0.55 # Positive orientable unit clauses : 41
% 0.21/0.55 # Positive unorientable unit clauses: 0
% 0.21/0.55 # Negative unit clauses : 1
% 0.21/0.55 # Non-unit-clauses : 267
% 0.21/0.55 # Current number of unprocessed clauses: 945
% 0.21/0.55 # ...number of literals in the above : 2952
% 0.21/0.55 # Current number of archived formulas : 0
% 0.21/0.55 # Current number of archived clauses : 66
% 0.21/0.55 # Clause-clause subsumption calls (NU) : 19156
% 0.21/0.55 # Rec. Clause-clause subsumption calls : 13429
% 0.21/0.55 # Non-unit clause-clause subsumptions : 82
% 0.21/0.55 # Unit Clause-clause subsumption calls : 55
% 0.21/0.55 # Rewrite failures with RHS unbound : 0
% 0.21/0.55 # BW rewrite match attempts : 83
% 0.21/0.55 # BW rewrite match successes : 0
% 0.21/0.55 # Condensation attempts : 0
% 0.21/0.55 # Condensation successes : 0
% 0.21/0.55 # Termbank termtop insertions : 32464
% 0.21/0.55 # Search garbage collected termcells : 219
% 0.21/0.55
% 0.21/0.55 # -------------------------------------------------
% 0.21/0.55 # User time : 0.050 s
% 0.21/0.55 # System time : 0.003 s
% 0.21/0.55 # Total time : 0.053 s
% 0.21/0.55 # Maximum resident set size: 1928 pages
% 0.21/0.55
% 0.21/0.55 # -------------------------------------------------
% 0.21/0.55 # User time : 0.052 s
% 0.21/0.55 # System time : 0.006 s
% 0.21/0.55 # Total time : 0.058 s
% 0.21/0.55 # Maximum resident set size: 1764 pages
% 0.21/0.55 % E---3.1 exiting
% 0.21/0.56 % E exiting
%------------------------------------------------------------------------------