TSTP Solution File: LCL080-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL080-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:28 EDT 2023
% Result : Unsatisfiable 0.23s 0.61s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of clauses : 27 ( 12 unt; 0 nHn; 14 RR)
% Number of literals : 45 ( 0 equ; 22 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 59 ( 12 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.24CmxmoYO7/E---3.1_13995.p',condensed_detachment) ).
cnf(ic_3,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X1),X1)),
file('/export/starexec/sandbox2/tmp/tmp.24CmxmoYO7/E---3.1_13995.p',ic_3) ).
cnf(ic_4,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
file('/export/starexec/sandbox2/tmp/tmp.24CmxmoYO7/E---3.1_13995.p',ic_4) ).
cnf(ic_2,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.24CmxmoYO7/E---3.1_13995.p',ic_2) ).
cnf(prove_ic_JLukasiewicz,negated_conjecture,
~ is_a_theorem(implies(implies(implies(a,b),c),implies(implies(c,a),implies(e,a)))),
file('/export/starexec/sandbox2/tmp/tmp.24CmxmoYO7/E---3.1_13995.p',prove_ic_JLukasiewicz) ).
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(implies(X1,X2),X1),X1)),
ic_3 ).
cnf(c_0_7,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
ic_4 ).
cnf(c_0_8,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X1,X2),X1)) ),
inference(pm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(pm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_10,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X1,X2))) ),
inference(pm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
ic_2 ).
cnf(c_0_12,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(pm,[status(thm)],[c_0_5,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
~ is_a_theorem(implies(implies(implies(a,b),c),implies(implies(c,a),implies(e,a)))),
prove_ic_JLukasiewicz ).
cnf(c_0_14,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(implies(X1,X2),X1)) ),
inference(pm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_15,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(pm,[status(thm)],[c_0_5,c_0_11]) ).
cnf(c_0_16,plain,
( is_a_theorem(implies(implies(implies(X1,X2),X1),X3))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(pm,[status(thm)],[c_0_12,c_0_6]) ).
cnf(c_0_17,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X1),X2)) ),
inference(pm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_18,negated_conjecture,
( ~ is_a_theorem(implies(X1,implies(implies(c,a),implies(e,a))))
| ~ is_a_theorem(implies(implies(implies(a,b),c),X1)) ),
inference(pm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_19,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(X1) ),
inference(pm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( is_a_theorem(implies(implies(X1,X2),X3))
| ~ is_a_theorem(implies(implies(implies(X2,X4),implies(X1,X4)),X3)) ),
inference(pm,[status(thm)],[c_0_12,c_0_7]) ).
cnf(c_0_21,plain,
( is_a_theorem(implies(implies(implies(X1,X2),X1),X3))
| ~ is_a_theorem(implies(X1,implies(implies(implies(X1,X2),X1),X3))) ),
inference(pm,[status(thm)],[c_0_10,c_0_16]) ).
cnf(c_0_22,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X1)))),
inference(pm,[status(thm)],[c_0_17,c_0_11]) ).
cnf(c_0_23,negated_conjecture,
( ~ is_a_theorem(implies(implies(implies(a,b),c),implies(X1,implies(implies(c,a),implies(e,a)))))
| ~ is_a_theorem(X1) ),
inference(pm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(implies(X1,X3),X4),implies(implies(X2,X3),X4)))),
inference(pm,[status(thm)],[c_0_20,c_0_7]) ).
cnf(c_0_25,plain,
is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1))),
inference(pm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : LCL080-2 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n025.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Oct 2 12:04:06 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.23/0.50 Running first-order theorem proving
% 0.23/0.50 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.24CmxmoYO7/E---3.1_13995.p
% 0.23/0.61 # Version: 3.1pre001
% 0.23/0.61 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.61 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.61 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.61 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.61 # Starting sh5l with 300s (1) cores
% 0.23/0.61 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 14183 completed with status 0
% 0.23/0.61 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.23/0.61 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.61 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.61 # No SInE strategy applied
% 0.23/0.61 # Search class: FHUNM-FFSF22-MFFFFFNN
% 0.23/0.61 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.61 # Starting G-E--_300_C01_S5PRR_S00 with 811s (1) cores
% 0.23/0.61 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.23/0.61 # Starting G-E--_300_C01_S00 with 136s (1) cores
% 0.23/0.61 # Starting new_bool_3 with 136s (1) cores
% 0.23/0.61 # Starting new_bool_1 with 136s (1) cores
% 0.23/0.61 # G-E--_300_C01_S5PRR_S00 with pid 14189 completed with status 0
% 0.23/0.61 # Result found by G-E--_300_C01_S5PRR_S00
% 0.23/0.61 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.61 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.61 # No SInE strategy applied
% 0.23/0.61 # Search class: FHUNM-FFSF22-MFFFFFNN
% 0.23/0.61 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.61 # Starting G-E--_300_C01_S5PRR_S00 with 811s (1) cores
% 0.23/0.61 # Preprocessing time : 0.001 s
% 0.23/0.61
% 0.23/0.61 # Proof found!
% 0.23/0.61 # SZS status Unsatisfiable
% 0.23/0.61 # SZS output start CNFRefutation
% See solution above
% 0.23/0.61 # Parsed axioms : 6
% 0.23/0.61 # Removed by relevancy pruning/SinE : 0
% 0.23/0.61 # Initial clauses : 6
% 0.23/0.61 # Removed in clause preprocessing : 0
% 0.23/0.61 # Initial clauses in saturation : 6
% 0.23/0.61 # Processed clauses : 977
% 0.23/0.61 # ...of these trivial : 11
% 0.23/0.61 # ...subsumed : 722
% 0.23/0.61 # ...remaining for further processing : 244
% 0.23/0.61 # Other redundant clauses eliminated : 0
% 0.23/0.61 # Clauses deleted for lack of memory : 0
% 0.23/0.61 # Backward-subsumed : 3
% 0.23/0.61 # Backward-rewritten : 3
% 0.23/0.61 # Generated clauses : 7420
% 0.23/0.61 # ...of the previous two non-redundant : 6991
% 0.23/0.61 # ...aggressively subsumed : 0
% 0.23/0.61 # Contextual simplify-reflections : 0
% 0.23/0.61 # Paramodulations : 7420
% 0.23/0.61 # Factorizations : 0
% 0.23/0.61 # NegExts : 0
% 0.23/0.61 # Equation resolutions : 0
% 0.23/0.61 # Total rewrite steps : 423
% 0.23/0.61 # Propositional unsat checks : 0
% 0.23/0.61 # Propositional check models : 0
% 0.23/0.61 # Propositional check unsatisfiable : 0
% 0.23/0.61 # Propositional clauses : 0
% 0.23/0.61 # Propositional clauses after purity: 0
% 0.23/0.61 # Propositional unsat core size : 0
% 0.23/0.61 # Propositional preprocessing time : 0.000
% 0.23/0.61 # Propositional encoding time : 0.000
% 0.23/0.61 # Propositional solver time : 0.000
% 0.23/0.61 # Success case prop preproc time : 0.000
% 0.23/0.61 # Success case prop encoding time : 0.000
% 0.23/0.61 # Success case prop solver time : 0.000
% 0.23/0.61 # Current number of processed clauses : 238
% 0.23/0.61 # Positive orientable unit clauses : 56
% 0.23/0.61 # Positive unorientable unit clauses: 0
% 0.23/0.61 # Negative unit clauses : 70
% 0.23/0.61 # Non-unit-clauses : 112
% 0.23/0.61 # Current number of unprocessed clauses: 5979
% 0.23/0.61 # ...number of literals in the above : 15089
% 0.23/0.61 # Current number of archived formulas : 0
% 0.23/0.61 # Current number of archived clauses : 6
% 0.23/0.61 # Clause-clause subsumption calls (NU) : 2250
% 0.23/0.61 # Rec. Clause-clause subsumption calls : 2196
% 0.23/0.61 # Non-unit clause-clause subsumptions : 272
% 0.23/0.61 # Unit Clause-clause subsumption calls : 454
% 0.23/0.61 # Rewrite failures with RHS unbound : 0
% 0.23/0.61 # BW rewrite match attempts : 2761
% 0.23/0.61 # BW rewrite match successes : 3
% 0.23/0.61 # Condensation attempts : 0
% 0.23/0.61 # Condensation successes : 0
% 0.23/0.61 # Termbank termtop insertions : 64952
% 0.23/0.61
% 0.23/0.61 # -------------------------------------------------
% 0.23/0.61 # User time : 0.092 s
% 0.23/0.61 # System time : 0.010 s
% 0.23/0.61 # Total time : 0.102 s
% 0.23/0.61 # Maximum resident set size: 1596 pages
% 0.23/0.61
% 0.23/0.61 # -------------------------------------------------
% 0.23/0.61 # User time : 0.485 s
% 0.23/0.61 # System time : 0.028 s
% 0.23/0.61 # Total time : 0.513 s
% 0.23/0.61 # Maximum resident set size: 1676 pages
% 0.23/0.61 % E---3.1 exiting
% 0.23/0.61 % E---3.1 exiting
%------------------------------------------------------------------------------