TSTP Solution File: LCL113-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL113-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:35 EDT 2023
% Result : Unsatisfiable 0.17s 0.48s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of clauses : 28 ( 15 unt; 0 nHn; 10 RR)
% Number of literals : 45 ( 0 equ; 19 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 56 ( 6 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.oq8HPogfLl/E---3.1_31513.p',condensed_detachment) ).
cnf(mv_2,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
file('/export/starexec/sandbox/tmp/tmp.oq8HPogfLl/E---3.1_31513.p',mv_2) ).
cnf(mv_3,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X2),implies(implies(X2,X1),X1))),
file('/export/starexec/sandbox/tmp/tmp.oq8HPogfLl/E---3.1_31513.p',mv_3) ).
cnf(mv_1,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
file('/export/starexec/sandbox/tmp/tmp.oq8HPogfLl/E---3.1_31513.p',mv_1) ).
cnf(mv_5,axiom,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
file('/export/starexec/sandbox/tmp/tmp.oq8HPogfLl/E---3.1_31513.p',mv_5) ).
cnf(prove_mv_33,negated_conjecture,
~ is_a_theorem(implies(implies(not(a),b),implies(not(b),a))),
file('/export/starexec/sandbox/tmp/tmp.oq8HPogfLl/E---3.1_31513.p',prove_mv_33) ).
cnf(c_0_6,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_7,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
mv_2 ).
cnf(c_0_8,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X2),implies(implies(X2,X1),X1))),
mv_3 ).
cnf(c_0_10,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
mv_1 ).
cnf(c_0_11,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_12,axiom,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
mv_5 ).
cnf(c_0_13,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(implies(X2,X1),X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_14,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_15,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X1,implies(not(X3),not(X2)))) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_15,c_0_10]) ).
cnf(c_0_18,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X3,X2)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_16]) ).
cnf(c_0_19,plain,
is_a_theorem(implies(not(not(X1)),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_20,plain,
( is_a_theorem(implies(not(not(X1)),X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_18,c_0_7]) ).
cnf(c_0_22,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),not(X1))) ),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(not(not(X1)),X1)),
inference(spm,[status(thm)],[c_0_20,c_0_17]) ).
cnf(c_0_24,negated_conjecture,
~ is_a_theorem(implies(implies(not(a),b),implies(not(b),a))),
prove_mv_33 ).
cnf(c_0_25,plain,
( is_a_theorem(implies(implies(not(X1),X2),implies(X3,X1)))
| ~ is_a_theorem(implies(X2,not(X3))) ),
inference(spm,[status(thm)],[c_0_15,c_0_21]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : LCL113-1 : TPTP v8.1.2. Released v1.0.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n015.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 13:16:01 EDT 2023
% 0.11/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.oq8HPogfLl/E---3.1_31513.p
% 0.17/0.48 # Version: 3.1pre001
% 0.17/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN 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 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 31591 completed with status 0
% 0.17/0.48 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.17/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.48 # No SInE strategy applied
% 0.17/0.48 # Search class: FHUNM-FFSF21-MFFFFFNN
% 0.17/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.48 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.17/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.17/0.48 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.48 # Starting new_bool_1 with 136s (1) cores
% 0.17/0.48 # Starting C12_02_nc_SAT001_MinMin_p005000_rr with 136s (1) cores
% 0.17/0.48 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 31596 completed with status 0
% 0.17/0.48 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.17/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.48 # No SInE strategy applied
% 0.17/0.48 # Search class: FHUNM-FFSF21-MFFFFFNN
% 0.17/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.48 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.17/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.17/0.48 # Preprocessing time : 0.002 s
% 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 : 6
% 0.17/0.48 # Removed by relevancy pruning/SinE : 0
% 0.17/0.48 # Initial clauses : 6
% 0.17/0.48 # Removed in clause preprocessing : 0
% 0.17/0.48 # Initial clauses in saturation : 6
% 0.17/0.48 # Processed clauses : 395
% 0.17/0.48 # ...of these trivial : 1
% 0.17/0.48 # ...subsumed : 247
% 0.17/0.48 # ...remaining for further processing : 147
% 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 : 0
% 0.17/0.48 # Generated clauses : 2302
% 0.17/0.48 # ...of the previous two non-redundant : 2175
% 0.17/0.48 # ...aggressively subsumed : 0
% 0.17/0.48 # Contextual simplify-reflections : 2
% 0.17/0.48 # Paramodulations : 2302
% 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 : 96
% 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 : 142
% 0.17/0.48 # Positive orientable unit clauses : 19
% 0.17/0.48 # Positive unorientable unit clauses: 0
% 0.17/0.48 # Negative unit clauses : 6
% 0.17/0.48 # Non-unit-clauses : 117
% 0.17/0.48 # Current number of unprocessed clauses: 1702
% 0.17/0.48 # ...number of literals in the above : 5138
% 0.17/0.48 # Current number of archived formulas : 0
% 0.17/0.48 # Current number of archived clauses : 5
% 0.17/0.48 # Clause-clause subsumption calls (NU) : 2599
% 0.17/0.48 # Rec. Clause-clause subsumption calls : 2489
% 0.17/0.48 # Non-unit clause-clause subsumptions : 249
% 0.17/0.48 # Unit Clause-clause subsumption calls : 109
% 0.17/0.48 # Rewrite failures with RHS unbound : 0
% 0.17/0.48 # BW rewrite match attempts : 202
% 0.17/0.48 # BW rewrite match successes : 2
% 0.17/0.48 # Condensation attempts : 0
% 0.17/0.48 # Condensation successes : 0
% 0.17/0.48 # Termbank termtop insertions : 29124
% 0.17/0.48
% 0.17/0.48 # -------------------------------------------------
% 0.17/0.48 # User time : 0.037 s
% 0.17/0.48 # System time : 0.004 s
% 0.17/0.48 # Total time : 0.041 s
% 0.17/0.48 # Maximum resident set size: 1596 pages
% 0.17/0.48
% 0.17/0.48 # -------------------------------------------------
% 0.17/0.48 # User time : 0.191 s
% 0.17/0.48 # System time : 0.014 s
% 0.17/0.48 # Total time : 0.206 s
% 0.17/0.48 # Maximum resident set size: 1676 pages
% 0.17/0.48 % E---3.1 exiting
% 0.17/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------