TSTP Solution File: SYN643-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYN643-1 : TPTP v8.2.0. 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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 08:00:50 EDT 2024
% Result : Unsatisfiable 1.46s 0.68s
% Output : CNFRefutation 1.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 27 ( 14 unt; 0 nHn; 25 RR)
% Number of literals : 55 ( 0 equ; 31 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p4_24,negated_conjecture,
( p4(X1,X2)
| ~ p4(X3,X1)
| ~ p4(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p4_24) ).
cnf(p4_35,negated_conjecture,
( p4(f9(X1,X2),f9(X3,X4))
| ~ p4(X2,X4)
| ~ p4(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p4_35) ).
cnf(p4_5,negated_conjecture,
p4(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p4_5) ).
cnf(p4_37,negated_conjecture,
( p4(f5(f10(X1,X2)),f9(f5(X1),f5(X2)))
| ~ p15(X1)
| ~ p15(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p4_37) ).
cnf(not_p4_28,negated_conjecture,
~ p4(f5(f10(f3(c19),f3(c18))),f9(f5(c19),f5(c18))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p4_28) ).
cnf(p4_10,negated_conjecture,
p4(f5(f3(c18)),f5(c18)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p4_10) ).
cnf(p4_11,negated_conjecture,
p4(f5(f3(c19)),f5(c19)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p4_11) ).
cnf(f3_is_p15_2,negated_conjecture,
p15(f3(c18)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f3_is_p15_2) ).
cnf(f3_is_p15_1,negated_conjecture,
p15(f3(c19)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f3_is_p15_1) ).
cnf(c_0_9,negated_conjecture,
( p4(X1,X2)
| ~ p4(X3,X1)
| ~ p4(X3,X2) ),
inference(fof_simplification,[status(thm)],[p4_24]) ).
cnf(c_0_10,negated_conjecture,
( p4(f9(X1,X2),f9(X3,X4))
| ~ p4(X2,X4)
| ~ p4(X1,X3) ),
inference(fof_simplification,[status(thm)],[p4_35]) ).
cnf(c_0_11,negated_conjecture,
( p4(X1,X2)
| ~ p4(X3,X1)
| ~ p4(X3,X2) ),
c_0_9 ).
cnf(c_0_12,negated_conjecture,
p4(X1,X1),
p4_5 ).
cnf(c_0_13,negated_conjecture,
( p4(f5(f10(X1,X2)),f9(f5(X1),f5(X2)))
| ~ p15(X1)
| ~ p15(X2) ),
inference(fof_simplification,[status(thm)],[p4_37]) ).
cnf(c_0_14,negated_conjecture,
( p4(f9(X1,X2),f9(X3,X4))
| ~ p4(X2,X4)
| ~ p4(X1,X3) ),
c_0_10 ).
cnf(c_0_15,negated_conjecture,
( p4(X1,X2)
| ~ p4(X2,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( p4(f5(f10(X1,X2)),f9(f5(X1),f5(X2)))
| ~ p15(X1)
| ~ p15(X2) ),
c_0_13 ).
cnf(c_0_17,negated_conjecture,
~ p4(f5(f10(f3(c19),f3(c18))),f9(f5(c19),f5(c18))),
inference(fof_simplification,[status(thm)],[not_p4_28]) ).
cnf(c_0_18,negated_conjecture,
( p4(X1,f9(X2,X3))
| ~ p4(f9(X4,X5),X1)
| ~ p4(X5,X3)
| ~ p4(X4,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( p4(f9(f5(X1),f5(X2)),f5(f10(X1,X2)))
| ~ p15(X2)
| ~ p15(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
~ p4(f5(f10(f3(c19),f3(c18))),f9(f5(c19),f5(c18))),
c_0_17 ).
cnf(c_0_21,negated_conjecture,
( p4(f5(f10(X1,X2)),f9(X3,X4))
| ~ p4(f5(X2),X4)
| ~ p4(f5(X1),X3)
| ~ p15(X2)
| ~ p15(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
p4(f5(f3(c18)),f5(c18)),
p4_10 ).
cnf(c_0_23,negated_conjecture,
p4(f5(f3(c19)),f5(c19)),
p4_11 ).
cnf(c_0_24,negated_conjecture,
p15(f3(c18)),
f3_is_p15_2 ).
cnf(c_0_25,negated_conjecture,
p15(f3(c19)),
f3_is_p15_1 ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23]),c_0_24]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SYN643-1 : TPTP v8.2.0. Released v2.5.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n013.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon May 20 15:11:08 EDT 2024
% 0.13/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/benchmark/theBenchmark.p
% 1.46/0.68 # Version: 3.1.0
% 1.46/0.68 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.46/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.46/0.68 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.46/0.68 # Starting new_bool_3 with 300s (1) cores
% 1.46/0.68 # Starting new_bool_1 with 300s (1) cores
% 1.46/0.68 # Starting sh5l with 300s (1) cores
% 1.46/0.68 # sh5l with pid 9879 completed with status 0
% 1.46/0.68 # Result found by sh5l
% 1.46/0.68 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.46/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.46/0.68 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.46/0.68 # Starting new_bool_3 with 300s (1) cores
% 1.46/0.68 # Starting new_bool_1 with 300s (1) cores
% 1.46/0.68 # Starting sh5l with 300s (1) cores
% 1.46/0.68 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.46/0.68 # Search class: FGUNM-FFMM21-MFFFFFNN
% 1.46/0.68 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.46/0.68 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.46/0.68 # SAT001_MinMin_p005000_rr_RG with pid 9887 completed with status 0
% 1.46/0.68 # Result found by SAT001_MinMin_p005000_rr_RG
% 1.46/0.68 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.46/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.46/0.68 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.46/0.68 # Starting new_bool_3 with 300s (1) cores
% 1.46/0.68 # Starting new_bool_1 with 300s (1) cores
% 1.46/0.68 # Starting sh5l with 300s (1) cores
% 1.46/0.68 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.46/0.68 # Search class: FGUNM-FFMM21-MFFFFFNN
% 1.46/0.68 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.46/0.68 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.46/0.68 # Preprocessing time : 0.002 s
% 1.46/0.68 # Presaturation interreduction done
% 1.46/0.68
% 1.46/0.68 # Proof found!
% 1.46/0.68 # SZS status Unsatisfiable
% 1.46/0.68 # SZS output start CNFRefutation
% See solution above
% 1.46/0.68 # Parsed axioms : 42
% 1.46/0.68 # Removed by relevancy pruning/SinE : 0
% 1.46/0.68 # Initial clauses : 42
% 1.46/0.68 # Removed in clause preprocessing : 0
% 1.46/0.68 # Initial clauses in saturation : 42
% 1.46/0.68 # Processed clauses : 3317
% 1.46/0.68 # ...of these trivial : 0
% 1.46/0.68 # ...subsumed : 2200
% 1.46/0.68 # ...remaining for further processing : 1117
% 1.46/0.68 # Other redundant clauses eliminated : 0
% 1.46/0.68 # Clauses deleted for lack of memory : 0
% 1.46/0.68 # Backward-subsumed : 58
% 1.46/0.68 # Backward-rewritten : 0
% 1.46/0.68 # Generated clauses : 14205
% 1.46/0.68 # ...of the previous two non-redundant : 12440
% 1.46/0.68 # ...aggressively subsumed : 0
% 1.46/0.68 # Contextual simplify-reflections : 0
% 1.46/0.68 # Paramodulations : 14205
% 1.46/0.68 # Factorizations : 0
% 1.46/0.68 # NegExts : 0
% 1.46/0.68 # Equation resolutions : 0
% 1.46/0.68 # Disequality decompositions : 0
% 1.46/0.68 # Total rewrite steps : 3053
% 1.46/0.68 # ...of those cached : 3014
% 1.46/0.68 # Propositional unsat checks : 0
% 1.46/0.68 # Propositional check models : 0
% 1.46/0.68 # Propositional check unsatisfiable : 0
% 1.46/0.68 # Propositional clauses : 0
% 1.46/0.68 # Propositional clauses after purity: 0
% 1.46/0.68 # Propositional unsat core size : 0
% 1.46/0.68 # Propositional preprocessing time : 0.000
% 1.46/0.68 # Propositional encoding time : 0.000
% 1.46/0.68 # Propositional solver time : 0.000
% 1.46/0.68 # Success case prop preproc time : 0.000
% 1.46/0.68 # Success case prop encoding time : 0.000
% 1.46/0.68 # Success case prop solver time : 0.000
% 1.46/0.68 # Current number of processed clauses : 1017
% 1.46/0.68 # Positive orientable unit clauses : 20
% 1.46/0.68 # Positive unorientable unit clauses: 0
% 1.46/0.68 # Negative unit clauses : 1
% 1.46/0.68 # Non-unit-clauses : 996
% 1.46/0.68 # Current number of unprocessed clauses: 9081
% 1.46/0.68 # ...number of literals in the above : 33738
% 1.46/0.68 # Current number of archived formulas : 0
% 1.46/0.68 # Current number of archived clauses : 100
% 1.46/0.68 # Clause-clause subsumption calls (NU) : 109463
% 1.46/0.68 # Rec. Clause-clause subsumption calls : 103244
% 1.46/0.68 # Non-unit clause-clause subsumptions : 2258
% 1.46/0.68 # Unit Clause-clause subsumption calls : 0
% 1.46/0.68 # Rewrite failures with RHS unbound : 0
% 1.46/0.68 # BW rewrite match attempts : 3
% 1.46/0.68 # BW rewrite match successes : 0
% 1.46/0.68 # Condensation attempts : 0
% 1.46/0.68 # Condensation successes : 0
% 1.46/0.68 # Termbank termtop insertions : 197760
% 1.46/0.68 # Search garbage collected termcells : 115
% 1.46/0.68
% 1.46/0.68 # -------------------------------------------------
% 1.46/0.68 # User time : 0.191 s
% 1.46/0.68 # System time : 0.005 s
% 1.46/0.68 # Total time : 0.196 s
% 1.46/0.68 # Maximum resident set size: 1720 pages
% 1.46/0.68
% 1.46/0.68 # -------------------------------------------------
% 1.46/0.68 # User time : 0.194 s
% 1.46/0.68 # System time : 0.006 s
% 1.46/0.68 # Total time : 0.200 s
% 1.46/0.68 # Maximum resident set size: 1756 pages
% 1.46/0.68 % E---3.1 exiting
%------------------------------------------------------------------------------