TSTP Solution File: LCL113-10 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL113-10 : TPTP v8.1.2. Released v7.3.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:35 EDT 2023
% Result : Unsatisfiable 206.62s 26.73s
% Output : CNFRefutation 206.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 7
% Syntax : Number of clauses : 43 ( 43 unt; 0 nHn; 3 RR)
% Number of literals : 43 ( 42 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-4 aty)
% Number of variables : 104 ( 15 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
ifeq(is_a_theorem(implies(X1,X2)),true,ifeq(is_a_theorem(X1),true,is_a_theorem(X2),true),true) = true,
file('/export/starexec/sandbox/tmp/tmp.sYG4euRBlj/E---3.1_28588.p',condensed_detachment) ).
cnf(mv_1,axiom,
is_a_theorem(implies(X1,implies(X2,X1))) = true,
file('/export/starexec/sandbox/tmp/tmp.sYG4euRBlj/E---3.1_28588.p',mv_1) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/tmp/tmp.sYG4euRBlj/E---3.1_28588.p',ifeq_axiom) ).
cnf(mv_2,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))) = true,
file('/export/starexec/sandbox/tmp/tmp.sYG4euRBlj/E---3.1_28588.p',mv_2) ).
cnf(mv_3,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X2),implies(implies(X2,X1),X1))) = true,
file('/export/starexec/sandbox/tmp/tmp.sYG4euRBlj/E---3.1_28588.p',mv_3) ).
cnf(mv_5,axiom,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))) = true,
file('/export/starexec/sandbox/tmp/tmp.sYG4euRBlj/E---3.1_28588.p',mv_5) ).
cnf(prove_mv_33,negated_conjecture,
is_a_theorem(implies(implies(not(a),b),implies(not(b),a))) != true,
file('/export/starexec/sandbox/tmp/tmp.sYG4euRBlj/E---3.1_28588.p',prove_mv_33) ).
cnf(c_0_7,axiom,
ifeq(is_a_theorem(implies(X1,X2)),true,ifeq(is_a_theorem(X1),true,is_a_theorem(X2),true),true) = true,
condensed_detachment ).
cnf(c_0_8,axiom,
is_a_theorem(implies(X1,implies(X2,X1))) = true,
mv_1 ).
cnf(c_0_9,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_10,plain,
ifeq(is_a_theorem(implies(implies(X1,implies(X2,X1)),X3)),true,is_a_theorem(X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
cnf(c_0_11,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))) = true,
mv_2 ).
cnf(c_0_12,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_9]) ).
cnf(c_0_13,plain,
ifeq(is_a_theorem(implies(implies(X1,X2),X3)),true,is_a_theorem(implies(X2,X3)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_12]),c_0_9]) ).
cnf(c_0_14,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X2),implies(implies(X2,X1),X1))) = true,
mv_3 ).
cnf(c_0_15,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_9]) ).
cnf(c_0_16,axiom,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))) = true,
mv_5 ).
cnf(c_0_17,plain,
ifeq(is_a_theorem(X1),true,is_a_theorem(implies(implies(X1,X2),X2)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_15]),c_0_9]) ).
cnf(c_0_18,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_16]),c_0_9]) ).
cnf(c_0_19,plain,
ifeq(is_a_theorem(implies(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))),X4)),true,is_a_theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_11]),c_0_9]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(implies(implies(not(X1),implies(X1,X2)),X3),X3)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_9]) ).
cnf(c_0_21,plain,
ifeq(is_a_theorem(implies(implies(implies(not(X1),not(X2)),implies(X2,X1)),X3)),true,is_a_theorem(X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_16]),c_0_9]) ).
cnf(c_0_22,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(not(X1),X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_9]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(not(not(X1)),implies(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_9]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X1)),X3),X3)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_15]),c_0_9]) ).
cnf(c_0_25,plain,
is_a_theorem(implies(implies(implies(not(not(X1)),implies(X2,X1)),X3),X3)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_23]),c_0_9]) ).
cnf(c_0_26,plain,
ifeq(is_a_theorem(implies(X1,X2)),true,is_a_theorem(implies(implies(X2,X3),implies(X1,X3))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_11]),c_0_9]) ).
cnf(c_0_27,plain,
ifeq(is_a_theorem(implies(implies(implies(implies(X1,implies(X2,X1)),X3),X3),X4)),true,is_a_theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_24]),c_0_9]) ).
cnf(c_0_28,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(not(not(X2)),X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_25]),c_0_9]) ).
cnf(c_0_29,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),X2),X3),implies(X1,X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_15]),c_0_9]) ).
cnf(c_0_30,plain,
ifeq(is_a_theorem(implies(not(X1),not(X2))),true,is_a_theorem(implies(X2,X1)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_16]),c_0_9]) ).
cnf(c_0_31,plain,
is_a_theorem(implies(not(not(X1)),X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_9]) ).
cnf(c_0_32,plain,
ifeq(is_a_theorem(implies(implies(implies(implies(implies(X1,X2),X2),X3),implies(X1,X3)),X4)),true,is_a_theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_29]),c_0_9]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),X4),implies(implies(X3,X1),X4))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_11]),c_0_9]) ).
cnf(c_0_34,plain,
is_a_theorem(implies(X1,not(not(X1)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_9]) ).
cnf(c_0_35,plain,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_9]) ).
cnf(c_0_36,plain,
ifeq(is_a_theorem(implies(implies(X1,not(not(X1))),X2)),true,is_a_theorem(X2),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_34]),c_0_9]) ).
cnf(c_0_37,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_35]),c_0_9]) ).
cnf(c_0_38,plain,
is_a_theorem(implies(implies(X1,X2),implies(X1,not(not(X2))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_9]) ).
cnf(c_0_39,plain,
is_a_theorem(implies(implies(implies(X1,not(not(X2))),X3),implies(implies(X1,X2),X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_38]),c_0_9]) ).
cnf(c_0_40,negated_conjecture,
is_a_theorem(implies(implies(not(a),b),implies(not(b),a))) != true,
prove_mv_33 ).
cnf(c_0_41,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(not(X2),X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_39]),c_0_9]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : LCL113-10 : TPTP v8.1.2. Released v7.3.0.
% 0.14/0.16 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n028.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 2400
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon Oct 2 13:09:06 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.22/0.52 Running first-order theorem proving
% 0.22/0.52 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.sYG4euRBlj/E---3.1_28588.p
% 206.62/26.73 # Version: 3.1pre001
% 206.62/26.73 # Preprocessing class: FSSSSMSSSSSNFFN.
% 206.62/26.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 206.62/26.73 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 206.62/26.73 # Starting new_bool_3 with 300s (1) cores
% 206.62/26.73 # Starting new_bool_1 with 300s (1) cores
% 206.62/26.73 # Starting sh5l with 300s (1) cores
% 206.62/26.73 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 28666 completed with status 0
% 206.62/26.73 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 206.62/26.73 # Preprocessing class: FSSSSMSSSSSNFFN.
% 206.62/26.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 206.62/26.73 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 206.62/26.73 # No SInE strategy applied
% 206.62/26.73 # Search class: FUUPM-FFSF32-MFFFFFNN
% 206.62/26.73 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 206.62/26.73 # Starting G-E--_107_C18_F1_AE_Q4_CS_SP_CO_S0Y with 811s (1) cores
% 206.62/26.73 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 206.62/26.73 # Starting G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 206.62/26.73 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 206.62/26.73 # Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 206.62/26.73 # G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with pid 28674 completed with status 0
% 206.62/26.73 # Result found by G-E--_208_B02_F1_AE_CS_SP_PS_S0Y
% 206.62/26.73 # Preprocessing class: FSSSSMSSSSSNFFN.
% 206.62/26.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 206.62/26.73 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 206.62/26.73 # No SInE strategy applied
% 206.62/26.73 # Search class: FUUPM-FFSF32-MFFFFFNN
% 206.62/26.73 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 206.62/26.73 # Starting G-E--_107_C18_F1_AE_Q4_CS_SP_CO_S0Y with 811s (1) cores
% 206.62/26.73 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 206.62/26.73 # Starting G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 206.62/26.73 # Preprocessing time : 0.001 s
% 206.62/26.73 # Presaturation interreduction done
% 206.62/26.73
% 206.62/26.73 # Proof found!
% 206.62/26.73 # SZS status Unsatisfiable
% 206.62/26.73 # SZS output start CNFRefutation
% See solution above
% 206.62/26.73 # Parsed axioms : 7
% 206.62/26.73 # Removed by relevancy pruning/SinE : 0
% 206.62/26.73 # Initial clauses : 7
% 206.62/26.73 # Removed in clause preprocessing : 0
% 206.62/26.73 # Initial clauses in saturation : 7
% 206.62/26.73 # Processed clauses : 11791
% 206.62/26.73 # ...of these trivial : 6614
% 206.62/26.73 # ...subsumed : 0
% 206.62/26.73 # ...remaining for further processing : 5177
% 206.62/26.73 # Other redundant clauses eliminated : 0
% 206.62/26.73 # Clauses deleted for lack of memory : 0
% 206.62/26.73 # Backward-subsumed : 0
% 206.62/26.73 # Backward-rewritten : 11
% 206.62/26.73 # Generated clauses : 1543803
% 206.62/26.73 # ...of the previous two non-redundant : 342502
% 206.62/26.73 # ...aggressively subsumed : 0
% 206.62/26.73 # Contextual simplify-reflections : 0
% 206.62/26.73 # Paramodulations : 1543803
% 206.62/26.73 # Factorizations : 0
% 206.62/26.73 # NegExts : 0
% 206.62/26.73 # Equation resolutions : 0
% 206.62/26.73 # Total rewrite steps : 1813380
% 206.62/26.73 # Propositional unsat checks : 0
% 206.62/26.73 # Propositional check models : 0
% 206.62/26.73 # Propositional check unsatisfiable : 0
% 206.62/26.73 # Propositional clauses : 0
% 206.62/26.73 # Propositional clauses after purity: 0
% 206.62/26.73 # Propositional unsat core size : 0
% 206.62/26.73 # Propositional preprocessing time : 0.000
% 206.62/26.73 # Propositional encoding time : 0.000
% 206.62/26.73 # Propositional solver time : 0.000
% 206.62/26.73 # Success case prop preproc time : 0.000
% 206.62/26.73 # Success case prop encoding time : 0.000
% 206.62/26.73 # Success case prop solver time : 0.000
% 206.62/26.73 # Current number of processed clauses : 5159
% 206.62/26.73 # Positive orientable unit clauses : 5159
% 206.62/26.73 # Positive unorientable unit clauses: 0
% 206.62/26.73 # Negative unit clauses : 0
% 206.62/26.73 # Non-unit-clauses : 0
% 206.62/26.73 # Current number of unprocessed clauses: 330680
% 206.62/26.73 # ...number of literals in the above : 330680
% 206.62/26.73 # Current number of archived formulas : 0
% 206.62/26.73 # Current number of archived clauses : 18
% 206.62/26.73 # Clause-clause subsumption calls (NU) : 0
% 206.62/26.73 # Rec. Clause-clause subsumption calls : 0
% 206.62/26.73 # Non-unit clause-clause subsumptions : 0
% 206.62/26.73 # Unit Clause-clause subsumption calls : 0
% 206.62/26.73 # Rewrite failures with RHS unbound : 0
% 206.62/26.73 # BW rewrite match attempts : 2967449
% 206.62/26.73 # BW rewrite match successes : 11
% 206.62/26.73 # Condensation attempts : 0
% 206.62/26.73 # Condensation successes : 0
% 206.62/26.73 # Termbank termtop insertions : 32352236
% 206.62/26.73
% 206.62/26.73 # -------------------------------------------------
% 206.62/26.73 # User time : 25.065 s
% 206.62/26.73 # System time : 0.595 s
% 206.62/26.73 # Total time : 25.659 s
% 206.62/26.73 # Maximum resident set size: 1508 pages
% 206.62/26.73
% 206.62/26.73 # -------------------------------------------------
% 206.62/26.73 # User time : 125.339 s
% 206.62/26.73 # System time : 3.006 s
% 206.62/26.73 # Total time : 128.345 s
% 206.62/26.73 # Maximum resident set size: 1672 pages
% 206.62/26.73 % E---3.1 exiting
% 206.62/26.73 % E---3.1 exiting
%------------------------------------------------------------------------------