TSTP Solution File: LCL027-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL027-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:17 EDT 2023
% Result : Unsatisfiable 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of clauses : 17 ( 10 unt; 0 nHn; 9 RR)
% Number of literals : 28 ( 0 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 31 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.XPu9mrnoYD/E---3.1_3178.p',condensed_detachment) ).
cnf(c0_6,axiom,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))),
file('/export/starexec/sandbox/tmp/tmp.XPu9mrnoYD/E---3.1_3178.p',c0_6) ).
cnf(c0_2,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
file('/export/starexec/sandbox/tmp/tmp.XPu9mrnoYD/E---3.1_3178.p',c0_2) ).
cnf(c0_5,axiom,
is_a_theorem(implies(implies(implies(X1,falsehood),falsehood),X1)),
file('/export/starexec/sandbox/tmp/tmp.XPu9mrnoYD/E---3.1_3178.p',c0_5) ).
cnf(prove_c0_4,negated_conjecture,
~ is_a_theorem(implies(falsehood,a)),
file('/export/starexec/sandbox/tmp/tmp.XPu9mrnoYD/E---3.1_3178.p',prove_c0_4) ).
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(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))),
c0_6 ).
cnf(c_0_7,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
| ~ is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
c0_2 ).
cnf(c_0_9,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X3,X2)))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_10,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_5,c_0_8]) ).
cnf(c_0_11,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,X3))
| ~ is_a_theorem(implies(X3,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_13,axiom,
is_a_theorem(implies(implies(implies(X1,falsehood),falsehood),X1)),
c0_5 ).
cnf(c_0_14,negated_conjecture,
~ is_a_theorem(implies(falsehood,a)),
prove_c0_4 ).
cnf(c_0_15,plain,
is_a_theorem(implies(falsehood,X1)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : LCL027-1 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n028.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 13:21:21 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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.XPu9mrnoYD/E---3.1_3178.p
% 0.21/0.52 # Version: 3.1pre001
% 0.21/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # sh5l with pid 3259 completed with status 0
% 0.21/0.52 # Result found by sh5l
% 0.21/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.52 # Search class: FHUNS-FFSF22-MFFFFFNN
% 0.21/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 163s (1) cores
% 0.21/0.52 # G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with pid 3265 completed with status 0
% 0.21/0.52 # Result found by G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y
% 0.21/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.52 # Search class: FHUNS-FFSF22-MFFFFFNN
% 0.21/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 163s (1) cores
% 0.21/0.52 # Preprocessing time : 0.001 s
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Unsatisfiable
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 5
% 0.21/0.52 # Removed by relevancy pruning/SinE : 0
% 0.21/0.52 # Initial clauses : 5
% 0.21/0.52 # Removed in clause preprocessing : 0
% 0.21/0.52 # Initial clauses in saturation : 5
% 0.21/0.52 # Processed clauses : 21
% 0.21/0.52 # ...of these trivial : 0
% 0.21/0.52 # ...subsumed : 2
% 0.21/0.52 # ...remaining for further processing : 19
% 0.21/0.52 # Other redundant clauses eliminated : 0
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 0
% 0.21/0.52 # Backward-rewritten : 3
% 0.21/0.52 # Generated clauses : 44
% 0.21/0.52 # ...of the previous two non-redundant : 33
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 0
% 0.21/0.52 # Paramodulations : 44
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 0
% 0.21/0.52 # Total rewrite steps : 6
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 16
% 0.21/0.52 # Positive orientable unit clauses : 5
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 1
% 0.21/0.52 # Non-unit-clauses : 10
% 0.21/0.52 # Current number of unprocessed clauses: 14
% 0.21/0.52 # ...number of literals in the above : 30
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 3
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 29
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 29
% 0.21/0.52 # Non-unit clause-clause subsumptions : 2
% 0.21/0.52 # Unit Clause-clause subsumption calls : 4
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 14
% 0.21/0.52 # BW rewrite match successes : 3
% 0.21/0.52 # Condensation attempts : 21
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 636
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.001 s
% 0.21/0.52 # System time : 0.003 s
% 0.21/0.52 # Total time : 0.004 s
% 0.21/0.52 # Maximum resident set size: 1640 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.001 s
% 0.21/0.52 # System time : 0.006 s
% 0.21/0.52 # Total time : 0.008 s
% 0.21/0.52 # Maximum resident set size: 1676 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------