TSTP Solution File: LCL042-10 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL042-10 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:23:32 EDT 2023
% Result : Unsatisfiable 880.46s 137.80s
% Output : CNFRefutation 880.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of clauses : 41 ( 41 unt; 0 nHn; 3 RR)
% Number of literals : 41 ( 40 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 : 8 ( 8 usr; 4 con; 0-4 aty)
% Number of variables : 112 ( 19 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.4UjRDAGJIu/E---3.1_29490.p',condensed_detachment) ).
cnf(cn_3,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))) = true,
file('/export/starexec/sandbox/tmp/tmp.4UjRDAGJIu/E---3.1_29490.p',cn_3) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/tmp/tmp.4UjRDAGJIu/E---3.1_29490.p',ifeq_axiom) ).
cnf(cn_22,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))) = true,
file('/export/starexec/sandbox/tmp/tmp.4UjRDAGJIu/E---3.1_29490.p',cn_22) ).
cnf(cn_18,axiom,
is_a_theorem(implies(X1,implies(X2,X1))) = true,
file('/export/starexec/sandbox/tmp/tmp.4UjRDAGJIu/E---3.1_29490.p',cn_18) ).
cnf(cn_21,axiom,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))) = true,
file('/export/starexec/sandbox/tmp/tmp.4UjRDAGJIu/E---3.1_29490.p',cn_21) ).
cnf(cn_54,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(not(X1),X2),X2))) = true,
file('/export/starexec/sandbox/tmp/tmp.4UjRDAGJIu/E---3.1_29490.p',cn_54) ).
cnf(prove_cn_35,negated_conjecture,
is_a_theorem(implies(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c)))) != true,
file('/export/starexec/sandbox/tmp/tmp.4UjRDAGJIu/E---3.1_29490.p',prove_cn_35) ).
cnf(c_0_8,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_9,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))) = true,
cn_3 ).
cnf(c_0_10,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_11,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))) = true,
cn_22 ).
cnf(c_0_12,axiom,
is_a_theorem(implies(X1,implies(X2,X1))) = true,
cn_18 ).
cnf(c_0_13,plain,
ifeq(is_a_theorem(implies(implies(X1,implies(not(X1),X2)),X3)),true,is_a_theorem(X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_14,axiom,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))) = true,
cn_21 ).
cnf(c_0_15,plain,
ifeq(is_a_theorem(implies(X1,X2)),true,is_a_theorem(implies(implies(X3,X1),implies(X3,X2))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_11]),c_0_10]) ).
cnf(c_0_16,plain,
ifeq(is_a_theorem(X1),true,is_a_theorem(implies(X2,X1)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_12]),c_0_10]) ).
cnf(c_0_17,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_10]) ).
cnf(c_0_18,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(not(X1),X2),X2))) = true,
cn_54 ).
cnf(c_0_19,plain,
ifeq(is_a_theorem(implies(X1,implies(X2,X3))),true,is_a_theorem(implies(X2,implies(X1,X3))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_14]),c_0_10]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(implies(X1,X2),implies(X1,implies(X3,X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_12]),c_0_10]) ).
cnf(c_0_21,plain,
is_a_theorem(implies(X1,implies(not(X2),implies(X2,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_10]) ).
cnf(c_0_22,plain,
ifeq(is_a_theorem(implies(X1,X2)),true,is_a_theorem(implies(implies(not(X1),X2),X2)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_18]),c_0_10]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),implies(X3,X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_10]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(not(X1),implies(X2,implies(X1,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_21]),c_0_10]) ).
cnf(c_0_25,plain,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X1,implies(implies(X4,X2),implies(X4,X3))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_11]),c_0_10]) ).
cnf(c_0_26,plain,
ifeq(is_a_theorem(implies(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2))),X4)),true,is_a_theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_11]),c_0_10]) ).
cnf(c_0_27,plain,
is_a_theorem(implies(implies(X1,implies(X2,implies(X3,X4))),implies(X1,implies(X3,implies(X2,X4))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_14]),c_0_10]) ).
cnf(c_0_28,plain,
is_a_theorem(implies(implies(not(X1),implies(implies(X1,X2),implies(X3,X2))),implies(implies(X1,X2),implies(X3,X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_10]) ).
cnf(c_0_29,plain,
ifeq(is_a_theorem(implies(implies(not(X1),implies(X2,implies(X1,X3))),X4)),true,is_a_theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_24]),c_0_10]) ).
cnf(c_0_30,plain,
is_a_theorem(implies(implies(X1,implies(X2,implies(X3,X4))),implies(X1,implies(X2,implies(implies(X5,X3),implies(X5,X4)))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_25]),c_0_10]) ).
cnf(c_0_31,plain,
is_a_theorem(implies(implies(X1,X2),implies(X3,implies(implies(X3,X1),X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_10]) ).
cnf(c_0_32,plain,
ifeq(is_a_theorem(implies(not(X1),implies(implies(X1,X2),implies(X3,X2)))),true,is_a_theorem(implies(implies(X1,X2),implies(X3,X2))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_28]),c_0_10]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(not(X1),implies(X2,implies(implies(X3,X1),implies(X3,X4))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_10]) ).
cnf(c_0_34,plain,
ifeq(is_a_theorem(implies(implies(implies(X1,X2),implies(X3,implies(implies(X3,X1),X2))),X4)),true,is_a_theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_31]),c_0_10]) ).
cnf(c_0_35,plain,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(implies(X2,X1),implies(X2,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_10]) ).
cnf(c_0_36,plain,
ifeq(is_a_theorem(implies(X1,implies(X2,implies(X3,X4)))),true,is_a_theorem(implies(X1,implies(X3,implies(X2,X4)))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_27]),c_0_10]) ).
cnf(c_0_37,plain,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X1,implies(implies(X1,X2),X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_10]) ).
cnf(c_0_38,negated_conjecture,
is_a_theorem(implies(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c)))) != true,
prove_cn_35 ).
cnf(c_0_39,plain,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_10]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15 % Problem : LCL042-10 : TPTP v8.1.2. Released v7.5.0.
% 0.07/0.16 % Command : run_E %s %d THM
% 0.14/0.37 % Computer : n014.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 2400
% 0.14/0.37 % WCLimit : 300
% 0.14/0.38 % DateTime : Mon Oct 2 12:51:34 EDT 2023
% 0.14/0.38 % CPUTime :
% 0.21/0.52 Running first-order model finding
% 0.21/0.52 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.4UjRDAGJIu/E---3.1_29490.p
% 880.46/137.80 # Version: 3.1pre001
% 880.46/137.80 # Preprocessing class: FSSSSMSSSSSNFFN.
% 880.46/137.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 880.46/137.80 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 880.46/137.80 # Starting new_bool_3 with 300s (1) cores
% 880.46/137.80 # Starting new_bool_1 with 300s (1) cores
% 880.46/137.80 # Starting sh5l with 300s (1) cores
% 880.46/137.80 # new_bool_1 with pid 29569 completed with status 8
% 880.46/137.80 # new_bool_3 with pid 29568 completed with status 8
% 880.46/137.80 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 29567 completed with status 0
% 880.46/137.80 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 880.46/137.80 # Preprocessing class: FSSSSMSSSSSNFFN.
% 880.46/137.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 880.46/137.80 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 880.46/137.80 # No SInE strategy applied
% 880.46/137.80 # Search class: FUUPM-FFSF32-MFFFFFNN
% 880.46/137.80 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 880.46/137.80 # Starting G-E--_107_C18_F1_AE_Q4_CS_SP_CO_S0Y with 811s (1) cores
% 880.46/137.80 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 880.46/137.80 # Starting G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 880.46/137.80 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 880.46/137.80 # Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 880.46/137.80 # G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with pid 29576 completed with status 7
% 880.46/137.80 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 130s (1) cores
% 880.46/137.80 # H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with pid 29577 completed with status 7
% 880.46/137.80 # U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 29578 completed with status 7
% 880.46/137.80 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 29575 completed with status 0
% 880.46/137.80 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 880.46/137.80 # Preprocessing class: FSSSSMSSSSSNFFN.
% 880.46/137.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 880.46/137.80 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 880.46/137.80 # No SInE strategy applied
% 880.46/137.80 # Search class: FUUPM-FFSF32-MFFFFFNN
% 880.46/137.80 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 880.46/137.80 # Starting G-E--_107_C18_F1_AE_Q4_CS_SP_CO_S0Y with 811s (1) cores
% 880.46/137.80 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 880.46/137.80 # Preprocessing time : 0.016 s
% 880.46/137.80
% 880.46/137.80 # Proof found!
% 880.46/137.80 # SZS status Unsatisfiable
% 880.46/137.80 # SZS output start CNFRefutation
% See solution above
% 880.46/137.80 # Parsed axioms : 8
% 880.46/137.80 # Removed by relevancy pruning/SinE : 0
% 880.46/137.80 # Initial clauses : 8
% 880.46/137.80 # Removed in clause preprocessing : 0
% 880.46/137.80 # Initial clauses in saturation : 8
% 880.46/137.80 # Processed clauses : 19282
% 880.46/137.80 # ...of these trivial : 11206
% 880.46/137.80 # ...subsumed : 0
% 880.46/137.80 # ...remaining for further processing : 8076
% 880.46/137.80 # Other redundant clauses eliminated : 0
% 880.46/137.80 # Clauses deleted for lack of memory : 3664
% 880.46/137.80 # Backward-subsumed : 0
% 880.46/137.80 # Backward-rewritten : 36
% 880.46/137.80 # Generated clauses : 6558787
% 880.46/137.80 # ...of the previous two non-redundant : 1644403
% 880.46/137.80 # ...aggressively subsumed : 0
% 880.46/137.80 # Contextual simplify-reflections : 0
% 880.46/137.80 # Paramodulations : 6558787
% 880.46/137.80 # Factorizations : 0
% 880.46/137.80 # NegExts : 0
% 880.46/137.80 # Equation resolutions : 0
% 880.46/137.80 # Total rewrite steps : 7675611
% 880.46/137.80 # Propositional unsat checks : 0
% 880.46/137.80 # Propositional check models : 0
% 880.46/137.80 # Propositional check unsatisfiable : 0
% 880.46/137.80 # Propositional clauses : 0
% 880.46/137.80 # Propositional clauses after purity: 0
% 880.46/137.80 # Propositional unsat core size : 0
% 880.46/137.80 # Propositional preprocessing time : 0.000
% 880.46/137.80 # Propositional encoding time : 0.000
% 880.46/137.80 # Propositional solver time : 0.000
% 880.46/137.80 # Success case prop preproc time : 0.000
% 880.46/137.80 # Success case prop encoding time : 0.000
% 880.46/137.80 # Success case prop solver time : 0.000
% 880.46/137.80 # Current number of processed clauses : 8040
% 880.46/137.80 # Positive orientable unit clauses : 8040
% 880.46/137.80 # Positive unorientable unit clauses: 0
% 880.46/137.80 # Negative unit clauses : 0
% 880.46/137.80 # Non-unit-clauses : 0
% 880.46/137.80 # Current number of unprocessed clauses: 646073
% 880.46/137.80 # ...number of literals in the above : 646073
% 880.46/137.80 # Current number of archived formulas : 0
% 880.46/137.80 # Current number of archived clauses : 36
% 880.46/137.80 # Clause-clause subsumption calls (NU) : 0
% 880.46/137.80 # Rec. Clause-clause subsumption calls : 0
% 880.46/137.80 # Non-unit clause-clause subsumptions : 0
% 880.46/137.80 # Unit Clause-clause subsumption calls : 0
% 880.46/137.80 # Rewrite failures with RHS unbound : 0
% 880.46/137.80 # BW rewrite match attempts : 6888427
% 880.46/137.80 # BW rewrite match successes : 35
% 880.46/137.80 # Condensation attempts : 0
% 880.46/137.80 # Condensation successes : 0
% 880.46/137.80 # Termbank termtop insertions : 188636130
% 880.46/137.80
% 880.46/137.80 # -------------------------------------------------
% 880.46/137.80 # User time : 537.799 s
% 880.46/137.80 # System time : 6.884 s
% 880.46/137.80 # Total time : 544.684 s
% 880.46/137.80 # Maximum resident set size: 1512 pages
% 880.46/137.80
% 880.46/137.80 # -------------------------------------------------
% 880.46/137.80 # User time : 735.035 s
% 880.46/137.80 # System time : 8.646 s
% 880.46/137.80 # Total time : 743.681 s
% 880.46/137.80 # Maximum resident set size: 1676 pages
% 880.46/137.80 % E---3.1 exiting
%------------------------------------------------------------------------------