TSTP Solution File: LCL341-10 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL341-10 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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:12:27 EDT 2023
% Result : Unsatisfiable 948.48s 119.91s
% Output : CNFRefutation 948.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 11
% Syntax : Number of clauses : 52 ( 52 unt; 0 nHn; 3 RR)
% Number of literals : 52 ( 51 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-4 aty)
% Number of variables : 118 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))) = true,
file('/export/starexec/sandbox/tmp/tmp.nKmzsAAsIG/E---3.1_9765.p',axiom_1_3) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox/tmp/tmp.nKmzsAAsIG/E---3.1_9765.p',implies_definition) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))) = true,
file('/export/starexec/sandbox/tmp/tmp.nKmzsAAsIG/E---3.1_9765.p',axiom_1_5) ).
cnf(rule_1,axiom,
ifeq(axiom(X1),true,theorem(X1),true) = true,
file('/export/starexec/sandbox/tmp/tmp.nKmzsAAsIG/E---3.1_9765.p',rule_1) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/tmp/tmp.nKmzsAAsIG/E---3.1_9765.p',ifeq_axiom) ).
cnf(rule_2,axiom,
ifeq(theorem(implies(X1,X2)),true,ifeq(theorem(X1),true,theorem(X2),true),true) = true,
file('/export/starexec/sandbox/tmp/tmp.nKmzsAAsIG/E---3.1_9765.p',rule_2) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))) = true,
file('/export/starexec/sandbox/tmp/tmp.nKmzsAAsIG/E---3.1_9765.p',axiom_1_6) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))) = true,
file('/export/starexec/sandbox/tmp/tmp.nKmzsAAsIG/E---3.1_9765.p',axiom_1_4) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox/tmp/tmp.nKmzsAAsIG/E---3.1_9765.p',and_defn) ).
cnf(equivalent_defn,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
file('/export/starexec/sandbox/tmp/tmp.nKmzsAAsIG/E---3.1_9765.p',equivalent_defn) ).
cnf(prove_this,negated_conjecture,
theorem(implies(p,equivalent(implies(p,q),q))) != true,
file('/export/starexec/sandbox/tmp/tmp.nKmzsAAsIG/E---3.1_9765.p',prove_this) ).
cnf(c_0_11,axiom,
axiom(implies(X1,or(X2,X1))) = true,
axiom_1_3 ).
cnf(c_0_12,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_13,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))) = true,
axiom_1_5 ).
cnf(c_0_14,axiom,
ifeq(axiom(X1),true,theorem(X1),true) = true,
rule_1 ).
cnf(c_0_15,plain,
axiom(implies(X1,implies(X2,X1))) = true,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_17,plain,
axiom(implies(implies(X1,or(X2,X3)),or(X2,implies(X1,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_12]),c_0_12]) ).
cnf(c_0_18,axiom,
ifeq(theorem(implies(X1,X2)),true,ifeq(theorem(X1),true,theorem(X2),true),true) = true,
rule_2 ).
cnf(c_0_19,plain,
theorem(implies(X1,implies(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_20,plain,
axiom(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_12]),c_0_12]) ).
cnf(c_0_21,plain,
ifeq(theorem(implies(implies(X1,implies(X2,X1)),X3)),true,theorem(X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_16]) ).
cnf(c_0_22,plain,
theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_20]),c_0_16]) ).
cnf(c_0_23,plain,
theorem(implies(X1,implies(X2,X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_16]) ).
cnf(c_0_24,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))) = true,
axiom_1_6 ).
cnf(c_0_25,axiom,
axiom(implies(or(X1,X2),or(X2,X1))) = true,
axiom_1_4 ).
cnf(c_0_26,plain,
theorem(implies(X1,X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_23]),c_0_16]) ).
cnf(c_0_27,plain,
axiom(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_12]),c_0_12]) ).
cnf(c_0_28,plain,
theorem(implies(or(X1,X2),or(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_25]),c_0_16]) ).
cnf(c_0_29,plain,
ifeq(theorem(implies(implies(X1,X1),X2)),true,theorem(X2),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_26]),c_0_16]) ).
cnf(c_0_30,plain,
theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_27]),c_0_16]) ).
cnf(c_0_31,plain,
theorem(implies(or(X1,not(X2)),implies(X2,X1))) = true,
inference(spm,[status(thm)],[c_0_28,c_0_12]) ).
cnf(c_0_32,plain,
theorem(implies(X1,implies(implies(X1,X2),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_22]),c_0_16]) ).
cnf(c_0_33,plain,
ifeq(theorem(implies(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2))),X4)),true,theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_30]),c_0_16]) ).
cnf(c_0_34,plain,
theorem(implies(implies(X1,not(X2)),implies(X2,not(X1)))) = true,
inference(spm,[status(thm)],[c_0_31,c_0_12]) ).
cnf(c_0_35,plain,
ifeq(theorem(implies(implies(X1,implies(implies(X1,X2),X2)),X3)),true,theorem(X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_32]),c_0_16]) ).
cnf(c_0_36,plain,
theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_22]),c_0_16]) ).
cnf(c_0_37,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_38,plain,
ifeq(theorem(implies(implies(implies(X1,not(X2)),implies(X2,not(X1))),X3)),true,theorem(X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_34]),c_0_16]) ).
cnf(c_0_39,plain,
theorem(implies(implies(implies(implies(X1,X2),X2),X3),implies(X1,X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_16]) ).
cnf(c_0_40,plain,
not(implies(X1,not(X2))) = and(X1,X2),
inference(rw,[status(thm)],[c_0_37,c_0_12]) ).
cnf(c_0_41,plain,
ifeq(theorem(implies(X1,X2)),true,theorem(implies(implies(X3,X1),implies(X3,X2))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_30]),c_0_16]) ).
cnf(c_0_42,plain,
theorem(implies(X1,implies(X2,and(X1,X2)))) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_16]) ).
cnf(c_0_43,plain,
theorem(implies(implies(X1,X2),implies(X1,implies(X3,and(X2,X3))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_16]) ).
cnf(c_0_44,plain,
ifeq(theorem(implies(X1,implies(X2,X3))),true,theorem(implies(X2,implies(X1,X3))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_22]),c_0_16]) ).
cnf(c_0_45,plain,
theorem(implies(X1,implies(X2,and(implies(implies(X1,X3),X3),X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_43]),c_0_16]) ).
cnf(c_0_46,plain,
theorem(implies(X1,implies(X2,and(implies(implies(X2,X3),X3),X1)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_16]) ).
cnf(c_0_47,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
equivalent_defn ).
cnf(c_0_48,plain,
theorem(implies(implies(X1,implies(X2,X1)),implies(X2,equivalent(implies(X2,X1),X1)))) = true,
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_49,negated_conjecture,
theorem(implies(p,equivalent(implies(p,q),q))) != true,
prove_this ).
cnf(c_0_50,plain,
theorem(implies(X1,equivalent(implies(X1,X2),X2))) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_48]),c_0_19]),c_0_16]),c_0_16]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL341-10 : TPTP v8.1.2. Released v7.5.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n031.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 13:28:28 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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.nKmzsAAsIG/E---3.1_9765.p
% 948.48/119.91 # Version: 3.1pre001
% 948.48/119.91 # Preprocessing class: FSMSSMSSSSSNFFN.
% 948.48/119.91 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 948.48/119.91 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 948.48/119.91 # Starting new_bool_3 with 300s (1) cores
% 948.48/119.91 # Starting new_bool_1 with 300s (1) cores
% 948.48/119.91 # Starting sh5l with 300s (1) cores
% 948.48/119.91 # sh5l with pid 9847 completed with status 0
% 948.48/119.91 # Result found by sh5l
% 948.48/119.91 # Preprocessing class: FSMSSMSSSSSNFFN.
% 948.48/119.91 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 948.48/119.91 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 948.48/119.91 # Starting new_bool_3 with 300s (1) cores
% 948.48/119.91 # Starting new_bool_1 with 300s (1) cores
% 948.48/119.91 # Starting sh5l with 300s (1) cores
% 948.48/119.91 # SinE strategy is gf500_gu_R04_F100_L20000
% 948.48/119.91 # Search class: FUUPM-FFSF31-MFFFFFNN
% 948.48/119.91 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 948.48/119.91 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 100s (1) cores
% 948.48/119.91 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 9852 completed with status 7
% 948.48/119.91 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 51s (1) cores
% 948.48/119.91 # G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 9906 completed with status 0
% 948.48/119.91 # Result found by G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 948.48/119.91 # Preprocessing class: FSMSSMSSSSSNFFN.
% 948.48/119.91 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 948.48/119.91 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 948.48/119.91 # Starting new_bool_3 with 300s (1) cores
% 948.48/119.91 # Starting new_bool_1 with 300s (1) cores
% 948.48/119.91 # Starting sh5l with 300s (1) cores
% 948.48/119.91 # SinE strategy is gf500_gu_R04_F100_L20000
% 948.48/119.91 # Search class: FUUPM-FFSF31-MFFFFFNN
% 948.48/119.91 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 948.48/119.91 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 100s (1) cores
% 948.48/119.91 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 9852 completed with status 7
% 948.48/119.91 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 51s (1) cores
% 948.48/119.91 # Preprocessing time : 0.001 s
% 948.48/119.91
% 948.48/119.91 # Proof found!
% 948.48/119.91 # SZS status Unsatisfiable
% 948.48/119.91 # SZS output start CNFRefutation
% See solution above
% 948.48/119.91 # Parsed axioms : 12
% 948.48/119.91 # Removed by relevancy pruning/SinE : 0
% 948.48/119.91 # Initial clauses : 12
% 948.48/119.91 # Removed in clause preprocessing : 0
% 948.48/119.91 # Initial clauses in saturation : 12
% 948.48/119.91 # Processed clauses : 8204
% 948.48/119.91 # ...of these trivial : 2521
% 948.48/119.91 # ...subsumed : 0
% 948.48/119.91 # ...remaining for further processing : 5683
% 948.48/119.91 # Other redundant clauses eliminated : 0
% 948.48/119.91 # Clauses deleted for lack of memory : 0
% 948.48/119.91 # Backward-subsumed : 0
% 948.48/119.91 # Backward-rewritten : 135
% 948.48/119.91 # Generated clauses : 1642049
% 948.48/119.91 # ...of the previous two non-redundant : 445230
% 948.48/119.91 # ...aggressively subsumed : 0
% 948.48/119.91 # Contextual simplify-reflections : 0
% 948.48/119.91 # Paramodulations : 1642049
% 948.48/119.91 # Factorizations : 0
% 948.48/119.91 # NegExts : 0
% 948.48/119.91 # Equation resolutions : 0
% 948.48/119.91 # Total rewrite steps : 1934768
% 948.48/119.91 # Propositional unsat checks : 0
% 948.48/119.91 # Propositional check models : 0
% 948.48/119.91 # Propositional check unsatisfiable : 0
% 948.48/119.91 # Propositional clauses : 0
% 948.48/119.91 # Propositional clauses after purity: 0
% 948.48/119.91 # Propositional unsat core size : 0
% 948.48/119.91 # Propositional preprocessing time : 0.000
% 948.48/119.91 # Propositional encoding time : 0.000
% 948.48/119.91 # Propositional solver time : 0.000
% 948.48/119.91 # Success case prop preproc time : 0.000
% 948.48/119.91 # Success case prop encoding time : 0.000
% 948.48/119.91 # Success case prop solver time : 0.000
% 948.48/119.91 # Current number of processed clauses : 5548
% 948.48/119.91 # Positive orientable unit clauses : 5547
% 948.48/119.91 # Positive unorientable unit clauses: 1
% 948.48/119.91 # Negative unit clauses : 0
% 948.48/119.91 # Non-unit-clauses : 0
% 948.48/119.91 # Current number of unprocessed clauses: 436906
% 948.48/119.91 # ...number of literals in the above : 436906
% 948.48/119.91 # Current number of archived formulas : 0
% 948.48/119.91 # Current number of archived clauses : 135
% 948.48/119.91 # Clause-clause subsumption calls (NU) : 0
% 948.48/119.91 # Rec. Clause-clause subsumption calls : 0
% 948.48/119.91 # Non-unit clause-clause subsumptions : 0
% 948.48/119.91 # Unit Clause-clause subsumption calls : 0
% 948.48/119.91 # Rewrite failures with RHS unbound : 0
% 948.48/119.91 # BW rewrite match attempts : 1928896
% 948.48/119.91 # BW rewrite match successes : 135
% 948.48/119.91 # Condensation attempts : 0
% 948.48/119.91 # Condensation successes : 0
% 948.48/119.91 # Termbank termtop insertions : 27470704
% 948.48/119.91
% 948.48/119.91 # -------------------------------------------------
% 948.48/119.91 # User time : 116.025 s
% 948.48/119.91 # System time : 2.122 s
% 948.48/119.91 # Total time : 118.147 s
% 948.48/119.91 # Maximum resident set size: 1596 pages
% 948.48/119.91
% 948.48/119.91 # -------------------------------------------------
% 948.48/119.91 # User time : 116.027 s
% 948.48/119.91 # System time : 2.127 s
% 948.48/119.91 # Total time : 118.154 s
% 948.48/119.91 # Maximum resident set size: 1676 pages
% 948.48/119.91 % E---3.1 exiting
% 948.48/119.91 % E---3.1 exiting
%------------------------------------------------------------------------------