TSTP Solution File: SYN144-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN144-1 : TPTP v8.1.2. 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 20:13:55 EDT 2023
% Result : Unsatisfiable 0.17s 0.48s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 33 ( 17 unt; 0 nHn; 33 RR)
% Number of literals : 57 ( 0 equ; 26 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 36 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_021,axiom,
( m1(X1,X2,X1)
| ~ l0(X1)
| ~ k0(X2) ),
file('/export/starexec/sandbox/tmp/tmp.azaQsjAaAt/E---3.1_25474.p',rule_021) ).
cnf(axiom_28,axiom,
k0(e),
file('/export/starexec/sandbox/tmp/tmp.azaQsjAaAt/E---3.1_25474.p',axiom_28) ).
cnf(axiom_20,axiom,
l0(a),
file('/export/starexec/sandbox/tmp/tmp.azaQsjAaAt/E---3.1_25474.p',axiom_20) ).
cnf(rule_176,axiom,
( p2(X1,X2,X1)
| ~ m1(X2,X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.azaQsjAaAt/E---3.1_25474.p',rule_176) ).
cnf(rule_155,axiom,
( p2(X1,X2,X2)
| ~ k1(X3)
| ~ p2(e,X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.azaQsjAaAt/E---3.1_25474.p',rule_155) ).
cnf(rule_001,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.azaQsjAaAt/E---3.1_25474.p',rule_001) ).
cnf(axiom_26,axiom,
n0(d,c),
file('/export/starexec/sandbox/tmp/tmp.azaQsjAaAt/E---3.1_25474.p',axiom_26) ).
cnf(rule_267,axiom,
( r3(X1,X2,X1)
| ~ p2(X1,X3,X2) ),
file('/export/starexec/sandbox/tmp/tmp.azaQsjAaAt/E---3.1_25474.p',rule_267) ).
cnf(rule_285,axiom,
( p4(X1,X1,X2)
| ~ r0(X1)
| ~ r3(X2,X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.azaQsjAaAt/E---3.1_25474.p',rule_285) ).
cnf(axiom_13,axiom,
r0(e),
file('/export/starexec/sandbox/tmp/tmp.azaQsjAaAt/E---3.1_25474.p',axiom_13) ).
cnf(rule_303,axiom,
( m5(X1,X2)
| ~ r0(X1)
| ~ p4(X1,X3,X2) ),
file('/export/starexec/sandbox/tmp/tmp.azaQsjAaAt/E---3.1_25474.p',rule_303) ).
cnf(prove_this,negated_conjecture,
~ m5(e,a),
file('/export/starexec/sandbox/tmp/tmp.azaQsjAaAt/E---3.1_25474.p',prove_this) ).
cnf(c_0_12,axiom,
( m1(X1,X2,X1)
| ~ l0(X1)
| ~ k0(X2) ),
rule_021 ).
cnf(c_0_13,axiom,
k0(e),
axiom_28 ).
cnf(c_0_14,plain,
( m1(X1,e,X1)
| ~ l0(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,axiom,
l0(a),
axiom_20 ).
cnf(c_0_16,axiom,
( p2(X1,X2,X1)
| ~ m1(X2,X1,X2) ),
rule_176 ).
cnf(c_0_17,plain,
m1(a,e,a),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,axiom,
( p2(X1,X2,X2)
| ~ k1(X3)
| ~ p2(e,X1,X2) ),
rule_155 ).
cnf(c_0_19,plain,
p2(e,a,e),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
rule_001 ).
cnf(c_0_21,axiom,
n0(d,c),
axiom_26 ).
cnf(c_0_22,plain,
( p2(a,e,e)
| ~ k1(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
k1(c),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,axiom,
( r3(X1,X2,X1)
| ~ p2(X1,X3,X2) ),
rule_267 ).
cnf(c_0_25,plain,
p2(a,e,e),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,axiom,
( p4(X1,X1,X2)
| ~ r0(X1)
| ~ r3(X2,X1,X2) ),
rule_285 ).
cnf(c_0_27,plain,
r3(a,e,a),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,axiom,
r0(e),
axiom_13 ).
cnf(c_0_29,axiom,
( m5(X1,X2)
| ~ r0(X1)
| ~ p4(X1,X3,X2) ),
rule_303 ).
cnf(c_0_30,plain,
p4(e,e,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_31,negated_conjecture,
~ m5(e,a),
prove_this ).
cnf(c_0_32,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_28])]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN144-1 : TPTP v8.1.2. Released v1.1.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.32 % Computer : n032.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 2400
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Mon Oct 2 18:13:04 EDT 2023
% 0.13/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.azaQsjAaAt/E---3.1_25474.p
% 0.17/0.48 # Version: 3.1pre001
% 0.17/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.48 # Starting sh5l with 300s (1) cores
% 0.17/0.48 # new_bool_1 with pid 25601 completed with status 0
% 0.17/0.48 # Result found by new_bool_1
% 0.17/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.48 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.17/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.48 # SAT001_MinMin_p005000_rr_RG with pid 25623 completed with status 0
% 0.17/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.48 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.17/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.48 # Preprocessing time : 0.004 s
% 0.17/0.48 # Presaturation interreduction done
% 0.17/0.48
% 0.17/0.48 # Proof found!
% 0.17/0.48 # SZS status Unsatisfiable
% 0.17/0.48 # SZS output start CNFRefutation
% See solution above
% 0.17/0.48 # Parsed axioms : 369
% 0.17/0.48 # Removed by relevancy pruning/SinE : 55
% 0.17/0.48 # Initial clauses : 314
% 0.17/0.48 # Removed in clause preprocessing : 7
% 0.17/0.48 # Initial clauses in saturation : 307
% 0.17/0.48 # Processed clauses : 674
% 0.17/0.48 # ...of these trivial : 28
% 0.17/0.48 # ...subsumed : 21
% 0.17/0.48 # ...remaining for further processing : 625
% 0.17/0.48 # Other redundant clauses eliminated : 0
% 0.17/0.48 # Clauses deleted for lack of memory : 0
% 0.17/0.48 # Backward-subsumed : 5
% 0.17/0.48 # Backward-rewritten : 44
% 0.17/0.48 # Generated clauses : 506
% 0.17/0.48 # ...of the previous two non-redundant : 317
% 0.17/0.48 # ...aggressively subsumed : 0
% 0.17/0.48 # Contextual simplify-reflections : 2
% 0.17/0.48 # Paramodulations : 506
% 0.17/0.48 # Factorizations : 0
% 0.17/0.48 # NegExts : 0
% 0.17/0.48 # Equation resolutions : 0
% 0.17/0.48 # Total rewrite steps : 397
% 0.17/0.48 # Propositional unsat checks : 0
% 0.17/0.48 # Propositional check models : 0
% 0.17/0.48 # Propositional check unsatisfiable : 0
% 0.17/0.48 # Propositional clauses : 0
% 0.17/0.48 # Propositional clauses after purity: 0
% 0.17/0.48 # Propositional unsat core size : 0
% 0.17/0.48 # Propositional preprocessing time : 0.000
% 0.17/0.48 # Propositional encoding time : 0.000
% 0.17/0.48 # Propositional solver time : 0.000
% 0.17/0.48 # Success case prop preproc time : 0.000
% 0.17/0.48 # Success case prop encoding time : 0.000
% 0.17/0.48 # Success case prop solver time : 0.000
% 0.17/0.48 # Current number of processed clauses : 301
% 0.17/0.48 # Positive orientable unit clauses : 117
% 0.17/0.48 # Positive unorientable unit clauses: 0
% 0.17/0.48 # Negative unit clauses : 1
% 0.17/0.48 # Non-unit-clauses : 183
% 0.17/0.48 # Current number of unprocessed clauses: 213
% 0.17/0.48 # ...number of literals in the above : 532
% 0.17/0.48 # Current number of archived formulas : 0
% 0.17/0.48 # Current number of archived clauses : 324
% 0.17/0.48 # Clause-clause subsumption calls (NU) : 25144
% 0.17/0.48 # Rec. Clause-clause subsumption calls : 18841
% 0.17/0.48 # Non-unit clause-clause subsumptions : 27
% 0.17/0.48 # Unit Clause-clause subsumption calls : 165
% 0.17/0.48 # Rewrite failures with RHS unbound : 0
% 0.17/0.48 # BW rewrite match attempts : 59
% 0.17/0.48 # BW rewrite match successes : 34
% 0.17/0.48 # Condensation attempts : 0
% 0.17/0.48 # Condensation successes : 0
% 0.17/0.48 # Termbank termtop insertions : 13868
% 0.17/0.48
% 0.17/0.48 # -------------------------------------------------
% 0.17/0.48 # User time : 0.028 s
% 0.17/0.48 # System time : 0.007 s
% 0.17/0.48 # Total time : 0.035 s
% 0.17/0.48 # Maximum resident set size: 2452 pages
% 0.17/0.48
% 0.17/0.48 # -------------------------------------------------
% 0.17/0.48 # User time : 0.030 s
% 0.17/0.48 # System time : 0.009 s
% 0.17/0.48 # Total time : 0.039 s
% 0.17/0.48 # Maximum resident set size: 2000 pages
% 0.17/0.48 % E---3.1 exiting
% 0.17/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------