TSTP Solution File: SYN563-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYN563-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:22:24 EDT 2024
% Result : Unsatisfiable 3.13s 0.90s
% Output : CNFRefutation 3.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of clauses : 47 ( 13 unt; 0 nHn; 41 RR)
% Number of literals : 108 ( 0 equ; 64 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 92 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p6_16,negated_conjecture,
( p6(X1,X2)
| ~ p2(X3,X1)
| ~ p6(X3,X4)
| ~ p2(X4,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.f4DilKgJyG/E---3.1_25498.p',p6_16) ).
cnf(p6_2,negated_conjecture,
p6(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.f4DilKgJyG/E---3.1_25498.p',p6_2) ).
cnf(p2_1,negated_conjecture,
p2(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.f4DilKgJyG/E---3.1_25498.p',p2_1) ).
cnf(p2_11,negated_conjecture,
( p2(f3(X1),f3(X2))
| ~ p2(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.f4DilKgJyG/E---3.1_25498.p',p2_11) ).
cnf(p6_14,negated_conjecture,
( p6(X1,X2)
| ~ p6(X1,X3)
| ~ p6(X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.f4DilKgJyG/E---3.1_25498.p',p6_14) ).
cnf(p5_17,negated_conjecture,
( p5(X1,X2)
| ~ p2(X3,X2)
| ~ p5(X4,X3)
| ~ p2(X4,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.f4DilKgJyG/E---3.1_25498.p',p5_17) ).
cnf(p6_9,negated_conjecture,
( p6(c7,f3(X1))
| ~ p6(c7,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.f4DilKgJyG/E---3.1_25498.p',p6_9) ).
cnf(p5_7,negated_conjecture,
p5(f3(f3(X1)),f3(f4(X1))),
file('/export/starexec/sandbox2/tmp/tmp.f4DilKgJyG/E---3.1_25498.p',p5_7) ).
cnf(p5_15,negated_conjecture,
( p5(X1,X2)
| ~ p5(X3,X2)
| ~ p6(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.f4DilKgJyG/E---3.1_25498.p',p5_15) ).
cnf(p6_10,negated_conjecture,
( p6(f4(X1),X2)
| ~ p5(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.f4DilKgJyG/E---3.1_25498.p',p6_10) ).
cnf(p2_4,negated_conjecture,
p2(f4(c7),f4(c8)),
file('/export/starexec/sandbox2/tmp/tmp.f4DilKgJyG/E---3.1_25498.p',p2_4) ).
cnf(not_p6_5,negated_conjecture,
~ p6(f4(c7),f3(f4(c8))),
file('/export/starexec/sandbox2/tmp/tmp.f4DilKgJyG/E---3.1_25498.p',not_p6_5) ).
cnf(c_0_12,negated_conjecture,
( p6(X1,X2)
| ~ p2(X3,X1)
| ~ p6(X3,X4)
| ~ p2(X4,X2) ),
inference(fof_simplification,[status(thm)],[p6_16]) ).
cnf(c_0_13,negated_conjecture,
( p6(X1,X2)
| ~ p2(X3,X1)
| ~ p6(X3,X4)
| ~ p2(X4,X2) ),
c_0_12 ).
cnf(c_0_14,negated_conjecture,
p6(X1,X1),
p6_2 ).
cnf(c_0_15,negated_conjecture,
( p6(X1,X2)
| ~ p2(X3,X2)
| ~ p2(X3,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,negated_conjecture,
p2(X1,X1),
p2_1 ).
cnf(c_0_17,negated_conjecture,
( p2(f3(X1),f3(X2))
| ~ p2(X1,X2) ),
inference(fof_simplification,[status(thm)],[p2_11]) ).
cnf(c_0_18,negated_conjecture,
( p6(X1,X2)
| ~ p6(X1,X3)
| ~ p6(X3,X2) ),
inference(fof_simplification,[status(thm)],[p6_14]) ).
cnf(c_0_19,negated_conjecture,
( p6(X1,X2)
| ~ p2(X2,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( p2(f3(X1),f3(X2))
| ~ p2(X1,X2) ),
c_0_17 ).
cnf(c_0_21,negated_conjecture,
( p5(X1,X2)
| ~ p2(X3,X2)
| ~ p5(X4,X3)
| ~ p2(X4,X1) ),
inference(fof_simplification,[status(thm)],[p5_17]) ).
cnf(c_0_22,negated_conjecture,
( p6(X1,X2)
| ~ p6(X1,X3)
| ~ p6(X3,X2) ),
c_0_18 ).
cnf(c_0_23,negated_conjecture,
( p6(f3(X1),f3(X2))
| ~ p2(X2,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( p6(c7,f3(X1))
| ~ p6(c7,X1) ),
inference(fof_simplification,[status(thm)],[p6_9]) ).
cnf(c_0_25,negated_conjecture,
( p5(X1,X2)
| ~ p2(X3,X2)
| ~ p5(X4,X3)
| ~ p2(X4,X1) ),
c_0_21 ).
cnf(c_0_26,negated_conjecture,
p5(f3(f3(X1)),f3(f4(X1))),
p5_7 ).
cnf(c_0_27,negated_conjecture,
( p6(X1,f3(X2))
| ~ p6(X1,f3(X3))
| ~ p2(X2,X3) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( p6(c7,f3(X1))
| ~ p6(c7,X1) ),
c_0_24 ).
cnf(c_0_29,negated_conjecture,
( p5(X1,X2)
| ~ p5(X3,X2)
| ~ p6(X1,X3) ),
inference(fof_simplification,[status(thm)],[p5_15]) ).
cnf(c_0_30,negated_conjecture,
( p5(X1,X2)
| ~ p2(f3(f3(X3)),X1)
| ~ p2(f3(f4(X3)),X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
( p6(c7,f3(X1))
| ~ p6(c7,X2)
| ~ p2(X1,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( p6(X1,f3(X2))
| ~ p6(X1,c7)
| ~ p6(c7,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( p5(X1,X2)
| ~ p5(X3,X2)
| ~ p6(X1,X3) ),
c_0_29 ).
cnf(c_0_34,negated_conjecture,
( p5(f3(f3(X1)),X2)
| ~ p2(f3(f4(X1)),X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_16]) ).
cnf(c_0_35,negated_conjecture,
( p6(c7,f3(X1))
| ~ p6(c7,X2)
| ~ p2(X1,f3(X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_14])]) ).
cnf(c_0_36,negated_conjecture,
( p5(X1,X2)
| ~ p6(X1,f3(f3(X3)))
| ~ p2(f3(f4(X3)),X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
( p6(c7,f3(f3(X1)))
| ~ p6(c7,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_16]) ).
cnf(c_0_38,negated_conjecture,
( p5(c7,X1)
| ~ p6(c7,X2)
| ~ p2(f3(f4(X2)),X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_39,negated_conjecture,
( p6(f4(X1),X2)
| ~ p5(X1,X2) ),
inference(fof_simplification,[status(thm)],[p6_10]) ).
cnf(c_0_40,negated_conjecture,
( p5(c7,f3(X1))
| ~ p6(c7,X2)
| ~ p2(f4(X2),X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_20]) ).
cnf(c_0_41,negated_conjecture,
p2(f4(c7),f4(c8)),
p2_4 ).
cnf(c_0_42,negated_conjecture,
~ p6(f4(c7),f3(f4(c8))),
inference(fof_simplification,[status(thm)],[not_p6_5]) ).
cnf(c_0_43,negated_conjecture,
( p6(f4(X1),X2)
| ~ p5(X1,X2) ),
c_0_39 ).
cnf(c_0_44,negated_conjecture,
p5(c7,f3(f4(c8))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_14])]) ).
cnf(c_0_45,negated_conjecture,
~ p6(f4(c7),f3(f4(c8))),
c_0_42 ).
cnf(c_0_46,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN563-1 : TPTP v8.1.2. Released v2.5.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 10:29:18 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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.f4DilKgJyG/E---3.1_25498.p
% 3.13/0.90 # Version: 3.1.0
% 3.13/0.90 # Preprocessing class: FSMSSMSSSSSNFFN.
% 3.13/0.90 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.13/0.90 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.13/0.90 # Starting new_bool_3 with 300s (1) cores
% 3.13/0.90 # Starting new_bool_1 with 300s (1) cores
% 3.13/0.90 # Starting sh5l with 300s (1) cores
% 3.13/0.90 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 25575 completed with status 0
% 3.13/0.90 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 3.13/0.90 # Preprocessing class: FSMSSMSSSSSNFFN.
% 3.13/0.90 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.13/0.90 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.13/0.90 # No SInE strategy applied
% 3.13/0.90 # Search class: FHUNS-FFSF11-SFFFFFNN
% 3.13/0.90 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.13/0.90 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 3.13/0.90 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 3.13/0.90 # Starting new_bool_3 with 136s (1) cores
% 3.13/0.90 # Starting new_bool_1 with 136s (1) cores
% 3.13/0.90 # Starting sh5l with 136s (1) cores
% 3.13/0.90 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 25580 completed with status 0
% 3.13/0.90 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 3.13/0.90 # Preprocessing class: FSMSSMSSSSSNFFN.
% 3.13/0.90 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.13/0.90 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.13/0.90 # No SInE strategy applied
% 3.13/0.90 # Search class: FHUNS-FFSF11-SFFFFFNN
% 3.13/0.90 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.13/0.90 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 3.13/0.90 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 3.13/0.90 # Preprocessing time : 0.001 s
% 3.13/0.90 # Presaturation interreduction done
% 3.13/0.90
% 3.13/0.90 # Proof found!
% 3.13/0.90 # SZS status Unsatisfiable
% 3.13/0.90 # SZS output start CNFRefutation
% See solution above
% 3.13/0.90 # Parsed axioms : 17
% 3.13/0.90 # Removed by relevancy pruning/SinE : 0
% 3.13/0.90 # Initial clauses : 17
% 3.13/0.90 # Removed in clause preprocessing : 0
% 3.13/0.90 # Initial clauses in saturation : 17
% 3.13/0.90 # Processed clauses : 4885
% 3.13/0.90 # ...of these trivial : 357
% 3.13/0.90 # ...subsumed : 2613
% 3.13/0.90 # ...remaining for further processing : 1915
% 3.13/0.90 # Other redundant clauses eliminated : 0
% 3.13/0.90 # Clauses deleted for lack of memory : 0
% 3.13/0.90 # Backward-subsumed : 87
% 3.13/0.90 # Backward-rewritten : 53
% 3.13/0.90 # Generated clauses : 46164
% 3.13/0.90 # ...of the previous two non-redundant : 38126
% 3.13/0.90 # ...aggressively subsumed : 0
% 3.13/0.90 # Contextual simplify-reflections : 0
% 3.13/0.90 # Paramodulations : 46164
% 3.13/0.90 # Factorizations : 0
% 3.13/0.90 # NegExts : 0
% 3.13/0.90 # Equation resolutions : 0
% 3.13/0.90 # Disequality decompositions : 0
% 3.13/0.90 # Total rewrite steps : 10583
% 3.13/0.90 # ...of those cached : 10247
% 3.13/0.90 # Propositional unsat checks : 0
% 3.13/0.90 # Propositional check models : 0
% 3.13/0.90 # Propositional check unsatisfiable : 0
% 3.13/0.90 # Propositional clauses : 0
% 3.13/0.90 # Propositional clauses after purity: 0
% 3.13/0.90 # Propositional unsat core size : 0
% 3.13/0.90 # Propositional preprocessing time : 0.000
% 3.13/0.90 # Propositional encoding time : 0.000
% 3.13/0.90 # Propositional solver time : 0.000
% 3.13/0.90 # Success case prop preproc time : 0.000
% 3.13/0.90 # Success case prop encoding time : 0.000
% 3.13/0.90 # Success case prop solver time : 0.000
% 3.13/0.90 # Current number of processed clauses : 1758
% 3.13/0.90 # Positive orientable unit clauses : 364
% 3.13/0.90 # Positive unorientable unit clauses: 0
% 3.13/0.90 # Negative unit clauses : 20
% 3.13/0.90 # Non-unit-clauses : 1374
% 3.13/0.90 # Current number of unprocessed clauses: 33170
% 3.13/0.90 # ...number of literals in the above : 93561
% 3.13/0.90 # Current number of archived formulas : 0
% 3.13/0.90 # Current number of archived clauses : 157
% 3.13/0.90 # Clause-clause subsumption calls (NU) : 110818
% 3.13/0.90 # Rec. Clause-clause subsumption calls : 109226
% 3.13/0.90 # Non-unit clause-clause subsumptions : 2507
% 3.13/0.90 # Unit Clause-clause subsumption calls : 972
% 3.13/0.90 # Rewrite failures with RHS unbound : 0
% 3.13/0.90 # BW rewrite match attempts : 8496
% 3.13/0.90 # BW rewrite match successes : 18
% 3.13/0.90 # Condensation attempts : 0
% 3.13/0.90 # Condensation successes : 0
% 3.13/0.90 # Termbank termtop insertions : 643240
% 3.13/0.90 # Search garbage collected termcells : 45
% 3.13/0.90
% 3.13/0.90 # -------------------------------------------------
% 3.13/0.90 # User time : 0.390 s
% 3.13/0.90 # System time : 0.015 s
% 3.13/0.90 # Total time : 0.405 s
% 3.13/0.90 # Maximum resident set size: 1660 pages
% 3.13/0.90
% 3.13/0.90 # -------------------------------------------------
% 3.13/0.90 # User time : 1.955 s
% 3.13/0.90 # System time : 0.037 s
% 3.13/0.90 # Total time : 1.991 s
% 3.13/0.90 # Maximum resident set size: 1700 pages
% 3.13/0.90 % E---3.1 exiting
%------------------------------------------------------------------------------