TSTP Solution File: SYN223-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYN223-1 : TPTP v8.1.2. Released v1.1.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:19:41 EDT 2024
% Result : Unsatisfiable 0.20s 0.55s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 30 ( 14 unt; 0 nHn; 30 RR)
% Number of literals : 52 ( 0 equ; 25 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 22 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_001,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.yuwLTJrJ3o/E---3.1_29195.p',rule_001) ).
cnf(rule_136,axiom,
( m2(b)
| ~ k1(b) ),
file('/export/starexec/sandbox/tmp/tmp.yuwLTJrJ3o/E---3.1_29195.p',rule_136) ).
cnf(axiom_11,axiom,
n0(e,b),
file('/export/starexec/sandbox/tmp/tmp.yuwLTJrJ3o/E---3.1_29195.p',axiom_11) ).
cnf(rule_090,axiom,
( p1(e,e,e)
| ~ r0(e)
| ~ k0(e) ),
file('/export/starexec/sandbox/tmp/tmp.yuwLTJrJ3o/E---3.1_29195.p',rule_090) ).
cnf(rule_217,axiom,
( l3(X1,X1)
| ~ n2(X1)
| ~ m2(b) ),
file('/export/starexec/sandbox/tmp/tmp.yuwLTJrJ3o/E---3.1_29195.p',rule_217) ).
cnf(rule_137,axiom,
( n2(X1)
| ~ p1(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.yuwLTJrJ3o/E---3.1_29195.p',rule_137) ).
cnf(axiom_13,axiom,
r0(e),
file('/export/starexec/sandbox/tmp/tmp.yuwLTJrJ3o/E---3.1_29195.p',axiom_13) ).
cnf(axiom_28,axiom,
k0(e),
file('/export/starexec/sandbox/tmp/tmp.yuwLTJrJ3o/E---3.1_29195.p',axiom_28) ).
cnf(prove_this,negated_conjecture,
~ l3(X1,e),
file('/export/starexec/sandbox/tmp/tmp.yuwLTJrJ3o/E---3.1_29195.p',prove_this) ).
cnf(c_0_9,plain,
( k1(X1)
| ~ n0(X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_10,plain,
( m2(b)
| ~ k1(b) ),
inference(fof_simplification,[status(thm)],[rule_136]) ).
cnf(c_0_11,plain,
( k1(X1)
| ~ n0(X2,X1) ),
c_0_9 ).
cnf(c_0_12,axiom,
n0(e,b),
axiom_11 ).
cnf(c_0_13,plain,
( p1(e,e,e)
| ~ r0(e)
| ~ k0(e) ),
inference(fof_simplification,[status(thm)],[rule_090]) ).
cnf(c_0_14,plain,
( l3(X1,X1)
| ~ n2(X1)
| ~ m2(b) ),
inference(fof_simplification,[status(thm)],[rule_217]) ).
cnf(c_0_15,plain,
( m2(b)
| ~ k1(b) ),
c_0_10 ).
cnf(c_0_16,plain,
k1(b),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( n2(X1)
| ~ p1(X2,X3,X1) ),
inference(fof_simplification,[status(thm)],[rule_137]) ).
cnf(c_0_18,plain,
( p1(e,e,e)
| ~ r0(e)
| ~ k0(e) ),
c_0_13 ).
cnf(c_0_19,axiom,
r0(e),
axiom_13 ).
cnf(c_0_20,axiom,
k0(e),
axiom_28 ).
cnf(c_0_21,negated_conjecture,
~ l3(X1,e),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_22,plain,
( l3(X1,X1)
| ~ n2(X1)
| ~ m2(b) ),
c_0_14 ).
cnf(c_0_23,plain,
m2(b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]) ).
cnf(c_0_24,plain,
( n2(X1)
| ~ p1(X2,X3,X1) ),
c_0_17 ).
cnf(c_0_25,plain,
p1(e,e,e),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_26,negated_conjecture,
~ l3(X1,e),
c_0_21 ).
cnf(c_0_27,plain,
( l3(X1,X1)
| ~ n2(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
cnf(c_0_28,plain,
n2(e),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN223-1 : TPTP v8.1.2. Released v1.1.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n003.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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:34:05 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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/tmp/tmp.yuwLTJrJ3o/E---3.1_29195.p
% 0.20/0.55 # Version: 3.1.0
% 0.20/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.55 # Starting sh5l with 300s (1) cores
% 0.20/0.55 # new_bool_3 with pid 29318 completed with status 0
% 0.20/0.55 # Result found by new_bool_3
% 0.20/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.55 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.20/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.55 # SAT001_MinMin_p005000_rr_RG with pid 29329 completed with status 0
% 0.20/0.55 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.55 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.20/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.55 # Preprocessing time : 0.005 s
% 0.20/0.55 # Presaturation interreduction done
% 0.20/0.55
% 0.20/0.55 # Proof found!
% 0.20/0.55 # SZS status Unsatisfiable
% 0.20/0.55 # SZS output start CNFRefutation
% See solution above
% 0.20/0.55 # Parsed axioms : 369
% 0.20/0.55 # Removed by relevancy pruning/SinE : 30
% 0.20/0.55 # Initial clauses : 339
% 0.20/0.55 # Removed in clause preprocessing : 6
% 0.20/0.55 # Initial clauses in saturation : 333
% 0.20/0.55 # Processed clauses : 460
% 0.20/0.55 # ...of these trivial : 11
% 0.20/0.55 # ...subsumed : 24
% 0.20/0.55 # ...remaining for further processing : 425
% 0.20/0.55 # Other redundant clauses eliminated : 0
% 0.20/0.55 # Clauses deleted for lack of memory : 0
% 0.20/0.55 # Backward-subsumed : 3
% 0.20/0.55 # Backward-rewritten : 16
% 0.20/0.55 # Generated clauses : 75
% 0.20/0.55 # ...of the previous two non-redundant : 67
% 0.20/0.55 # ...aggressively subsumed : 0
% 0.20/0.55 # Contextual simplify-reflections : 2
% 0.20/0.55 # Paramodulations : 75
% 0.20/0.55 # Factorizations : 0
% 0.20/0.55 # NegExts : 0
% 0.20/0.55 # Equation resolutions : 0
% 0.20/0.55 # Disequality decompositions : 0
% 0.20/0.55 # Total rewrite steps : 103
% 0.20/0.55 # ...of those cached : 51
% 0.20/0.55 # Propositional unsat checks : 0
% 0.20/0.55 # Propositional check models : 0
% 0.20/0.55 # Propositional check unsatisfiable : 0
% 0.20/0.55 # Propositional clauses : 0
% 0.20/0.55 # Propositional clauses after purity: 0
% 0.20/0.55 # Propositional unsat core size : 0
% 0.20/0.55 # Propositional preprocessing time : 0.000
% 0.20/0.55 # Propositional encoding time : 0.000
% 0.20/0.55 # Propositional solver time : 0.000
% 0.20/0.55 # Success case prop preproc time : 0.000
% 0.20/0.55 # Success case prop encoding time : 0.000
% 0.20/0.55 # Success case prop solver time : 0.000
% 0.20/0.55 # Current number of processed clauses : 108
% 0.20/0.55 # Positive orientable unit clauses : 65
% 0.20/0.55 # Positive unorientable unit clauses: 0
% 0.20/0.55 # Negative unit clauses : 2
% 0.20/0.55 # Non-unit-clauses : 41
% 0.20/0.55 # Current number of unprocessed clauses: 235
% 0.20/0.55 # ...number of literals in the above : 693
% 0.20/0.55 # Current number of archived formulas : 0
% 0.20/0.55 # Current number of archived clauses : 317
% 0.20/0.55 # Clause-clause subsumption calls (NU) : 19266
% 0.20/0.55 # Rec. Clause-clause subsumption calls : 12663
% 0.20/0.55 # Non-unit clause-clause subsumptions : 28
% 0.20/0.55 # Unit Clause-clause subsumption calls : 65
% 0.20/0.55 # Rewrite failures with RHS unbound : 0
% 0.20/0.55 # BW rewrite match attempts : 17
% 0.20/0.55 # BW rewrite match successes : 14
% 0.20/0.55 # Condensation attempts : 0
% 0.20/0.55 # Condensation successes : 0
% 0.20/0.55 # Termbank termtop insertions : 12624
% 0.20/0.55 # Search garbage collected termcells : 1503
% 0.20/0.55
% 0.20/0.55 # -------------------------------------------------
% 0.20/0.55 # User time : 0.033 s
% 0.20/0.55 # System time : 0.007 s
% 0.20/0.55 # Total time : 0.041 s
% 0.20/0.55 # Maximum resident set size: 2640 pages
% 0.20/0.55
% 0.20/0.55 # -------------------------------------------------
% 0.20/0.55 # User time : 0.040 s
% 0.20/0.55 # System time : 0.011 s
% 0.20/0.55 # Total time : 0.050 s
% 0.20/0.55 # Maximum resident set size: 2016 pages
% 0.20/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------