TSTP Solution File: LCL072-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL072-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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 18:11:26 EDT 2023
% Result : Unsatisfiable 0.16s 0.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 5
% Syntax : Number of clauses : 28 ( 16 unt; 0 nHn; 9 RR)
% Number of literals : 44 ( 0 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 74 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.CcnUjQV54h/E---3.1_12558.p',condensed_detachment) ).
cnf(cn_60,axiom,
is_a_theorem(implies(implies(X1,implies(not(X2),X3)),implies(X1,implies(implies(X4,X3),implies(implies(X2,X4),X3))))),
file('/export/starexec/sandbox2/tmp/tmp.CcnUjQV54h/E---3.1_12558.p',cn_60) ).
cnf(cn_19,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
file('/export/starexec/sandbox2/tmp/tmp.CcnUjQV54h/E---3.1_12558.p',cn_19) ).
cnf(cn_37,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(not(X1),X3))),
file('/export/starexec/sandbox2/tmp/tmp.CcnUjQV54h/E---3.1_12558.p',cn_37) ).
cnf(prove_cn_3,negated_conjecture,
~ is_a_theorem(implies(a,implies(not(a),b))),
file('/export/starexec/sandbox2/tmp/tmp.CcnUjQV54h/E---3.1_12558.p',prove_cn_3) ).
cnf(c_0_5,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_6,axiom,
is_a_theorem(implies(implies(X1,implies(not(X2),X3)),implies(X1,implies(implies(X4,X3),implies(implies(X2,X4),X3))))),
cn_60 ).
cnf(c_0_7,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),implies(implies(X4,X2),X3))))
| ~ is_a_theorem(implies(X1,implies(not(X4),X3))) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
cn_19 ).
cnf(c_0_9,plain,
( is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),X2)))
| ~ is_a_theorem(implies(X4,implies(not(X3),X2)))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_10,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(not(X1),X3))),
cn_37 ).
cnf(c_0_11,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_5,c_0_8]) ).
cnf(c_0_12,plain,
( is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),X2)))
| ~ is_a_theorem(implies(implies(X3,X4),X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_14,plain,
is_a_theorem(implies(implies(X1,implies(X2,implies(X3,X4))),implies(implies(X3,X1),implies(X2,implies(X3,X4))))),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,implies(X1,X4))))
| ~ is_a_theorem(implies(X2,implies(X3,implies(X1,X4)))) ),
inference(spm,[status(thm)],[c_0_5,c_0_14]) ).
cnf(c_0_16,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X4,implies(X1,implies(X2,X3))))
| ~ is_a_theorem(implies(X2,X4)) ),
inference(spm,[status(thm)],[c_0_5,c_0_15]) ).
cnf(c_0_17,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_16,c_0_13]) ).
cnf(c_0_18,plain,
is_a_theorem(implies(X1,implies(X2,X2))),
inference(spm,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_19,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(implies(implies(X1,X3),X2)) ),
inference(spm,[status(thm)],[c_0_5,c_0_10]) ).
cnf(c_0_20,plain,
( is_a_theorem(implies(X1,X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_5,c_0_18]) ).
cnf(c_0_21,plain,
is_a_theorem(implies(not(implies(X1,X2)),implies(X2,X3))),
inference(spm,[status(thm)],[c_0_19,c_0_8]) ).
cnf(c_0_22,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_19,c_0_22]) ).
cnf(c_0_24,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_16,c_0_23]) ).
cnf(c_0_25,negated_conjecture,
~ is_a_theorem(implies(a,implies(not(a),b))),
prove_cn_3 ).
cnf(c_0_26,plain,
is_a_theorem(implies(X1,implies(not(X1),X2))),
inference(spm,[status(thm)],[c_0_24,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : LCL072-1 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n007.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 11:35:09 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.CcnUjQV54h/E---3.1_12558.p
% 0.16/0.45 # Version: 3.1pre001
% 0.16/0.45 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # Starting sh5l with 300s (1) cores
% 0.16/0.45 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 12636 completed with status 0
% 0.16/0.45 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.16/0.45 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.45 # No SInE strategy applied
% 0.16/0.45 # Search class: FHUNS-FFSF21-MFFFFFNN
% 0.16/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.45 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 811s (1) cores
% 0.16/0.45 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.16/0.45 # Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 0.16/0.45 # Starting new_bool_3 with 136s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 136s (1) cores
% 0.16/0.45 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 12642 completed with status 0
% 0.16/0.45 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.16/0.45 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.45 # No SInE strategy applied
% 0.16/0.45 # Search class: FHUNS-FFSF21-MFFFFFNN
% 0.16/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.45 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 811s (1) cores
% 0.16/0.45 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.16/0.45 # Preprocessing time : 0.001 s
% 0.16/0.45
% 0.16/0.45 # Proof found!
% 0.16/0.45 # SZS status Unsatisfiable
% 0.16/0.45 # SZS output start CNFRefutation
% See solution above
% 0.16/0.45 # Parsed axioms : 5
% 0.16/0.45 # Removed by relevancy pruning/SinE : 0
% 0.16/0.45 # Initial clauses : 5
% 0.16/0.45 # Removed in clause preprocessing : 0
% 0.16/0.45 # Initial clauses in saturation : 5
% 0.16/0.45 # Processed clauses : 135
% 0.16/0.45 # ...of these trivial : 4
% 0.16/0.45 # ...subsumed : 59
% 0.16/0.45 # ...remaining for further processing : 72
% 0.16/0.45 # Other redundant clauses eliminated : 0
% 0.16/0.45 # Clauses deleted for lack of memory : 0
% 0.16/0.45 # Backward-subsumed : 3
% 0.16/0.45 # Backward-rewritten : 3
% 0.16/0.45 # Generated clauses : 436
% 0.16/0.45 # ...of the previous two non-redundant : 397
% 0.16/0.45 # ...aggressively subsumed : 0
% 0.16/0.45 # Contextual simplify-reflections : 0
% 0.16/0.45 # Paramodulations : 436
% 0.16/0.45 # Factorizations : 0
% 0.16/0.45 # NegExts : 0
% 0.16/0.45 # Equation resolutions : 0
% 0.16/0.45 # Total rewrite steps : 32
% 0.16/0.45 # Propositional unsat checks : 0
% 0.16/0.45 # Propositional check models : 0
% 0.16/0.45 # Propositional check unsatisfiable : 0
% 0.16/0.45 # Propositional clauses : 0
% 0.16/0.45 # Propositional clauses after purity: 0
% 0.16/0.45 # Propositional unsat core size : 0
% 0.16/0.45 # Propositional preprocessing time : 0.000
% 0.16/0.45 # Propositional encoding time : 0.000
% 0.16/0.45 # Propositional solver time : 0.000
% 0.16/0.45 # Success case prop preproc time : 0.000
% 0.16/0.45 # Success case prop encoding time : 0.000
% 0.16/0.45 # Success case prop solver time : 0.000
% 0.16/0.45 # Current number of processed clauses : 66
% 0.16/0.45 # Positive orientable unit clauses : 25
% 0.16/0.45 # Positive unorientable unit clauses: 0
% 0.16/0.45 # Negative unit clauses : 3
% 0.16/0.45 # Non-unit-clauses : 38
% 0.16/0.45 # Current number of unprocessed clauses: 227
% 0.16/0.45 # ...number of literals in the above : 432
% 0.16/0.45 # Current number of archived formulas : 0
% 0.16/0.45 # Current number of archived clauses : 6
% 0.16/0.45 # Clause-clause subsumption calls (NU) : 747
% 0.16/0.45 # Rec. Clause-clause subsumption calls : 747
% 0.16/0.45 # Non-unit clause-clause subsumptions : 60
% 0.16/0.45 # Unit Clause-clause subsumption calls : 86
% 0.16/0.45 # Rewrite failures with RHS unbound : 0
% 0.16/0.45 # BW rewrite match attempts : 332
% 0.16/0.45 # BW rewrite match successes : 4
% 0.16/0.45 # Condensation attempts : 0
% 0.16/0.45 # Condensation successes : 0
% 0.16/0.45 # Termbank termtop insertions : 6688
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.010 s
% 0.16/0.45 # System time : 0.003 s
% 0.16/0.45 # Total time : 0.013 s
% 0.16/0.45 # Maximum resident set size: 1596 pages
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.052 s
% 0.16/0.45 # System time : 0.011 s
% 0.16/0.45 # Total time : 0.063 s
% 0.16/0.45 # Maximum resident set size: 1680 pages
% 0.16/0.45 % E---3.1 exiting
% 0.16/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------