TSTP Solution File: SYN695-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYN695-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:01:00 EDT 2024
% Result : Unsatisfiable 0.13s 0.50s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 26 ( 14 unt; 0 nHn; 22 RR)
% Number of literals : 45 ( 0 equ; 23 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p2_41,negated_conjecture,
( p2(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X3,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_41) ).
cnf(p2_12,negated_conjecture,
p2(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_12) ).
cnf(p2_54,negated_conjecture,
p2(f11(f4(f23(c44,f9(f20(c37)))),c43),f11(f4(c44),c43)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_54) ).
cnf(not_p2_55,negated_conjecture,
~ p2(f11(f4(c45),c43),f11(f4(f23(c44,f9(f20(c37)))),c43)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p2_55) ).
cnf(p2_61,negated_conjecture,
( p2(f11(X1,X2),f11(X3,X4))
| ~ p10(X2,X4)
| ~ p3(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_61) ).
cnf(p3_30,negated_conjecture,
( p3(f4(X1),f4(X2))
| ~ p2(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_30) ).
cnf(p2_18,negated_conjecture,
p2(c44,c45),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_18) ).
cnf(p10_7,negated_conjecture,
p10(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p10_7) ).
cnf(c_0_8,negated_conjecture,
( p2(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X3,X2) ),
inference(fof_simplification,[status(thm)],[p2_41]) ).
cnf(c_0_9,negated_conjecture,
( p2(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X3,X2) ),
c_0_8 ).
cnf(c_0_10,negated_conjecture,
p2(X1,X1),
p2_12 ).
cnf(c_0_11,negated_conjecture,
( p2(X1,X2)
| ~ p2(X2,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,negated_conjecture,
p2(f11(f4(f23(c44,f9(f20(c37)))),c43),f11(f4(c44),c43)),
p2_54 ).
cnf(c_0_13,negated_conjecture,
~ p2(f11(f4(c45),c43),f11(f4(f23(c44,f9(f20(c37)))),c43)),
inference(fof_simplification,[status(thm)],[not_p2_55]) ).
cnf(c_0_14,negated_conjecture,
p2(f11(f4(c44),c43),f11(f4(f23(c44,f9(f20(c37)))),c43)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
( p2(f11(X1,X2),f11(X3,X4))
| ~ p10(X2,X4)
| ~ p3(X1,X3) ),
inference(fof_simplification,[status(thm)],[p2_61]) ).
cnf(c_0_16,negated_conjecture,
( p3(f4(X1),f4(X2))
| ~ p2(X1,X2) ),
inference(fof_simplification,[status(thm)],[p3_30]) ).
cnf(c_0_17,negated_conjecture,
~ p2(f11(f4(c45),c43),f11(f4(f23(c44,f9(f20(c37)))),c43)),
c_0_13 ).
cnf(c_0_18,negated_conjecture,
( p2(X1,f11(f4(f23(c44,f9(f20(c37)))),c43))
| ~ p2(f11(f4(c44),c43),X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( p2(f11(X1,X2),f11(X3,X4))
| ~ p10(X2,X4)
| ~ p3(X1,X3) ),
c_0_15 ).
cnf(c_0_20,negated_conjecture,
( p3(f4(X1),f4(X2))
| ~ p2(X1,X2) ),
c_0_16 ).
cnf(c_0_21,negated_conjecture,
~ p2(f11(f4(c44),c43),f11(f4(c45),c43)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( p2(f11(f4(X1),X2),f11(f4(X3),X4))
| ~ p2(X1,X3)
| ~ p10(X2,X4) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
p2(c44,c45),
p2_18 ).
cnf(c_0_24,negated_conjecture,
p10(X1,X1),
p10_7 ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SYN695-1 : TPTP v8.2.0. Released v2.5.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.08/0.30 % Computer : n021.cluster.edu
% 0.08/0.30 % Model : x86_64 x86_64
% 0.08/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.30 % Memory : 8042.1875MB
% 0.08/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.30 % CPULimit : 300
% 0.08/0.30 % WCLimit : 300
% 0.08/0.30 % DateTime : Mon May 20 15:19:52 EDT 2024
% 0.08/0.30 % CPUTime :
% 0.13/0.43 Running first-order model finding
% 0.13/0.43 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.13/0.50 # Version: 3.1.0
% 0.13/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.50 # Starting sh5l with 300s (1) cores
% 0.13/0.50 # new_bool_1 with pid 30243 completed with status 0
% 0.13/0.50 # Result found by new_bool_1
% 0.13/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.50 # Search class: FGHNM-FFMM21-MFFFFFNN
% 0.13/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.13/0.50 # SAT001_MinMin_p005000_rr_RG with pid 30250 completed with status 0
% 0.13/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.13/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.50 # Search class: FGHNM-FFMM21-MFFFFFNN
% 0.13/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.13/0.50 # Preprocessing time : 0.002 s
% 0.13/0.50 # Presaturation interreduction done
% 0.13/0.50
% 0.13/0.50 # Proof found!
% 0.13/0.50 # SZS status Unsatisfiable
% 0.13/0.50 # SZS output start CNFRefutation
% See solution above
% 0.13/0.50 # Parsed axioms : 73
% 0.13/0.50 # Removed by relevancy pruning/SinE : 0
% 0.13/0.50 # Initial clauses : 73
% 0.13/0.50 # Removed in clause preprocessing : 0
% 0.13/0.50 # Initial clauses in saturation : 73
% 0.13/0.50 # Processed clauses : 811
% 0.13/0.50 # ...of these trivial : 0
% 0.13/0.50 # ...subsumed : 234
% 0.13/0.50 # ...remaining for further processing : 577
% 0.13/0.50 # Other redundant clauses eliminated : 0
% 0.13/0.50 # Clauses deleted for lack of memory : 0
% 0.13/0.50 # Backward-subsumed : 6
% 0.13/0.50 # Backward-rewritten : 0
% 0.13/0.50 # Generated clauses : 2511
% 0.13/0.50 # ...of the previous two non-redundant : 2413
% 0.13/0.50 # ...aggressively subsumed : 0
% 0.13/0.50 # Contextual simplify-reflections : 1
% 0.13/0.50 # Paramodulations : 2511
% 0.13/0.50 # Factorizations : 0
% 0.13/0.50 # NegExts : 0
% 0.13/0.50 # Equation resolutions : 0
% 0.13/0.50 # Disequality decompositions : 0
% 0.13/0.50 # Total rewrite steps : 207
% 0.13/0.50 # ...of those cached : 170
% 0.13/0.50 # Propositional unsat checks : 0
% 0.13/0.50 # Propositional check models : 0
% 0.13/0.50 # Propositional check unsatisfiable : 0
% 0.13/0.50 # Propositional clauses : 0
% 0.13/0.50 # Propositional clauses after purity: 0
% 0.13/0.50 # Propositional unsat core size : 0
% 0.13/0.50 # Propositional preprocessing time : 0.000
% 0.13/0.50 # Propositional encoding time : 0.000
% 0.13/0.50 # Propositional solver time : 0.000
% 0.13/0.50 # Success case prop preproc time : 0.000
% 0.13/0.50 # Success case prop encoding time : 0.000
% 0.13/0.50 # Success case prop solver time : 0.000
% 0.13/0.50 # Current number of processed clauses : 498
% 0.13/0.50 # Positive orientable unit clauses : 36
% 0.13/0.50 # Positive unorientable unit clauses: 0
% 0.13/0.50 # Negative unit clauses : 6
% 0.13/0.50 # Non-unit-clauses : 456
% 0.13/0.50 # Current number of unprocessed clauses: 1748
% 0.13/0.50 # ...number of literals in the above : 5553
% 0.13/0.50 # Current number of archived formulas : 0
% 0.13/0.50 # Current number of archived clauses : 79
% 0.13/0.50 # Clause-clause subsumption calls (NU) : 33456
% 0.13/0.50 # Rec. Clause-clause subsumption calls : 28794
% 0.13/0.50 # Non-unit clause-clause subsumptions : 235
% 0.13/0.50 # Unit Clause-clause subsumption calls : 165
% 0.13/0.50 # Rewrite failures with RHS unbound : 0
% 0.13/0.50 # BW rewrite match attempts : 11
% 0.13/0.50 # BW rewrite match successes : 0
% 0.13/0.50 # Condensation attempts : 0
% 0.13/0.50 # Condensation successes : 0
% 0.13/0.50 # Termbank termtop insertions : 40001
% 0.13/0.50 # Search garbage collected termcells : 202
% 0.13/0.50
% 0.13/0.50 # -------------------------------------------------
% 0.13/0.50 # User time : 0.041 s
% 0.13/0.50 # System time : 0.009 s
% 0.13/0.50 # Total time : 0.049 s
% 0.13/0.50 # Maximum resident set size: 1932 pages
% 0.13/0.50
% 0.13/0.50 # -------------------------------------------------
% 0.13/0.50 # User time : 0.042 s
% 0.13/0.50 # System time : 0.011 s
% 0.13/0.50 # Total time : 0.052 s
% 0.13/0.50 # Maximum resident set size: 1764 pages
% 0.13/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------