TSTP Solution File: SYN225-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYN225-1 : TPTP v8.2.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 07:57:32 EDT 2024
% Result : Unsatisfiable 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 22 ( 12 unt; 0 nHn; 22 RR)
% Number of literals : 38 ( 0 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 19 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_021,axiom,
( m1(X1,X2,X1)
| ~ l0(X1)
| ~ k0(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_021) ).
cnf(axiom_32,axiom,
k0(b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_32) ).
cnf(rule_176,axiom,
( p2(X1,X2,X1)
| ~ m1(X2,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_176) ).
cnf(axiom_20,axiom,
l0(a),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_20) ).
cnf(rule_215,axiom,
( l3(X1,X2)
| ~ r0(X1)
| ~ p2(X1,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_215) ).
cnf(prove_this,negated_conjecture,
~ l3(b,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(axiom_9,axiom,
r0(b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_9) ).
cnf(c_0_7,plain,
( m1(X1,X2,X1)
| ~ l0(X1)
| ~ k0(X2) ),
inference(fof_simplification,[status(thm)],[rule_021]) ).
cnf(c_0_8,plain,
( m1(X1,X2,X1)
| ~ l0(X1)
| ~ k0(X2) ),
c_0_7 ).
cnf(c_0_9,axiom,
k0(b),
axiom_32 ).
cnf(c_0_10,plain,
( p2(X1,X2,X1)
| ~ m1(X2,X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_176]) ).
cnf(c_0_11,plain,
( m1(X1,b,X1)
| ~ l0(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,axiom,
l0(a),
axiom_20 ).
cnf(c_0_13,plain,
( l3(X1,X2)
| ~ r0(X1)
| ~ p2(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_215]) ).
cnf(c_0_14,plain,
( p2(X1,X2,X1)
| ~ m1(X2,X1,X2) ),
c_0_10 ).
cnf(c_0_15,plain,
m1(a,b,a),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
~ l3(b,a),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_17,plain,
( l3(X1,X2)
| ~ r0(X1)
| ~ p2(X1,X2,X1) ),
c_0_13 ).
cnf(c_0_18,plain,
p2(b,a,b),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,axiom,
r0(b),
axiom_9 ).
cnf(c_0_20,negated_conjecture,
~ l3(b,a),
c_0_16 ).
cnf(c_0_21,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SYN225-1 : TPTP v8.2.0. Released v1.1.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 300
% 0.10/0.29 % DateTime : Mon May 20 13:39:07 EDT 2024
% 0.10/0.29 % CPUTime :
% 0.14/0.37 Running first-order model finding
% 0.14/0.37 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.14/0.41 # Version: 3.1.0
% 0.14/0.41 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 # Starting sh5l with 300s (1) cores
% 0.14/0.41 # new_bool_1 with pid 28269 completed with status 0
% 0.14/0.41 # Result found by new_bool_1
% 0.14/0.41 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.14/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.14/0.41 # SAT001_MinMin_p005000_rr_RG with pid 28276 completed with status 0
% 0.14/0.41 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.14/0.41 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.14/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.14/0.41 # Preprocessing time : 0.003 s
% 0.14/0.41 # Presaturation interreduction done
% 0.14/0.41
% 0.14/0.41 # Proof found!
% 0.14/0.41 # SZS status Unsatisfiable
% 0.14/0.41 # SZS output start CNFRefutation
% See solution above
% 0.14/0.41 # Parsed axioms : 369
% 0.14/0.41 # Removed by relevancy pruning/SinE : 30
% 0.14/0.41 # Initial clauses : 339
% 0.14/0.41 # Removed in clause preprocessing : 6
% 0.14/0.41 # Initial clauses in saturation : 333
% 0.14/0.41 # Processed clauses : 618
% 0.14/0.41 # ...of these trivial : 19
% 0.14/0.41 # ...subsumed : 23
% 0.14/0.41 # ...remaining for further processing : 576
% 0.14/0.41 # Other redundant clauses eliminated : 0
% 0.14/0.41 # Clauses deleted for lack of memory : 0
% 0.14/0.41 # Backward-subsumed : 8
% 0.14/0.41 # Backward-rewritten : 38
% 0.14/0.41 # Generated clauses : 315
% 0.14/0.41 # ...of the previous two non-redundant : 198
% 0.14/0.41 # ...aggressively subsumed : 0
% 0.14/0.41 # Contextual simplify-reflections : 2
% 0.14/0.41 # Paramodulations : 315
% 0.14/0.41 # Factorizations : 0
% 0.14/0.41 # NegExts : 0
% 0.14/0.41 # Equation resolutions : 0
% 0.14/0.41 # Disequality decompositions : 0
% 0.14/0.41 # Total rewrite steps : 255
% 0.14/0.41 # ...of those cached : 148
% 0.14/0.41 # Propositional unsat checks : 0
% 0.14/0.41 # Propositional check models : 0
% 0.14/0.41 # Propositional check unsatisfiable : 0
% 0.14/0.41 # Propositional clauses : 0
% 0.14/0.41 # Propositional clauses after purity: 0
% 0.14/0.41 # Propositional unsat core size : 0
% 0.14/0.41 # Propositional preprocessing time : 0.000
% 0.14/0.41 # Propositional encoding time : 0.000
% 0.14/0.41 # Propositional solver time : 0.000
% 0.14/0.41 # Success case prop preproc time : 0.000
% 0.14/0.41 # Success case prop encoding time : 0.000
% 0.14/0.41 # Success case prop solver time : 0.000
% 0.14/0.41 # Current number of processed clauses : 232
% 0.14/0.41 # Positive orientable unit clauses : 99
% 0.14/0.41 # Positive unorientable unit clauses: 0
% 0.14/0.41 # Negative unit clauses : 1
% 0.14/0.41 # Non-unit-clauses : 132
% 0.14/0.41 # Current number of unprocessed clauses: 204
% 0.14/0.41 # ...number of literals in the above : 569
% 0.14/0.41 # Current number of archived formulas : 0
% 0.14/0.41 # Current number of archived clauses : 344
% 0.14/0.41 # Clause-clause subsumption calls (NU) : 23560
% 0.14/0.41 # Rec. Clause-clause subsumption calls : 16323
% 0.14/0.41 # Non-unit clause-clause subsumptions : 30
% 0.14/0.41 # Unit Clause-clause subsumption calls : 319
% 0.14/0.41 # Rewrite failures with RHS unbound : 0
% 0.14/0.41 # BW rewrite match attempts : 52
% 0.14/0.41 # BW rewrite match successes : 35
% 0.14/0.41 # Condensation attempts : 0
% 0.14/0.41 # Condensation successes : 0
% 0.14/0.41 # Termbank termtop insertions : 15145
% 0.14/0.41 # Search garbage collected termcells : 1501
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.027 s
% 0.14/0.41 # System time : 0.001 s
% 0.14/0.41 # Total time : 0.028 s
% 0.14/0.41 # Maximum resident set size: 2636 pages
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.032 s
% 0.14/0.41 # System time : 0.001 s
% 0.14/0.41 # Total time : 0.033 s
% 0.14/0.41 # Maximum resident set size: 2020 pages
% 0.14/0.41 % E---3.1 exiting
%------------------------------------------------------------------------------