TSTP Solution File: REL023+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : REL023+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 19:13:37 EDT 2023
% Result : Theorem 0.17s 0.46s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 8
% Syntax : Number of formulae : 60 ( 60 unt; 0 def)
% Number of atoms : 60 ( 59 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 92 ( 4 sgn; 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(maddux2_join_associativity,axiom,
! [X1,X2,X3] : join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.4zToqxbK6e/E---3.1_10489.p',maddux2_join_associativity) ).
fof(def_top,axiom,
! [X1] : top = join(X1,complement(X1)),
file('/export/starexec/sandbox/tmp/tmp.4zToqxbK6e/E---3.1_10489.p',def_top) ).
fof(maddux4_definiton_of_meet,axiom,
! [X1,X2] : meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox/tmp/tmp.4zToqxbK6e/E---3.1_10489.p',maddux4_definiton_of_meet) ).
fof(def_zero,axiom,
! [X1] : zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox/tmp/tmp.4zToqxbK6e/E---3.1_10489.p',def_zero) ).
fof(maddux1_join_commutativity,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.4zToqxbK6e/E---3.1_10489.p',maddux1_join_commutativity) ).
fof(maddux3_a_kind_of_de_Morgan,axiom,
! [X1,X2] : X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
file('/export/starexec/sandbox/tmp/tmp.4zToqxbK6e/E---3.1_10489.p',maddux3_a_kind_of_de_Morgan) ).
fof(goals,conjecture,
! [X1,X2,X3] : join(composition(meet(X1,converse(X2)),meet(X2,X3)),composition(X1,meet(X2,X3))) = composition(X1,meet(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.4zToqxbK6e/E---3.1_10489.p',goals) ).
fof(composition_distributivity,axiom,
! [X1,X2,X3] : composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.4zToqxbK6e/E---3.1_10489.p',composition_distributivity) ).
fof(c_0_8,plain,
! [X22,X23,X24] : join(X22,join(X23,X24)) = join(join(X22,X23),X24),
inference(variable_rename,[status(thm)],[maddux2_join_associativity]) ).
fof(c_0_9,plain,
! [X30] : top = join(X30,complement(X30)),
inference(variable_rename,[status(thm)],[def_top]) ).
fof(c_0_10,plain,
! [X17,X18] : meet(X17,X18) = complement(join(complement(X17),complement(X18))),
inference(variable_rename,[status(thm)],[maddux4_definiton_of_meet]) ).
fof(c_0_11,plain,
! [X19] : zero = meet(X19,complement(X19)),
inference(variable_rename,[status(thm)],[def_zero]) ).
cnf(c_0_12,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
top = join(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,plain,
! [X20,X21] : join(X20,X21) = join(X21,X20),
inference(variable_rename,[status(thm)],[maddux1_join_commutativity]) ).
fof(c_0_15,plain,
! [X25,X26] : X25 = join(complement(join(complement(X25),complement(X26))),complement(join(complement(X25),X26))),
inference(variable_rename,[status(thm)],[maddux3_a_kind_of_de_Morgan]) ).
cnf(c_0_16,plain,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
zero = meet(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
join(X1,join(complement(X1),X2)) = join(top,X2),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
complement(top) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_13]),c_0_17]) ).
cnf(c_0_22,plain,
join(X1,join(X2,complement(X1))) = join(top,X2),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
join(meet(X1,X2),complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[c_0_20,c_0_16]) ).
cnf(c_0_24,plain,
join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
inference(spm,[status(thm)],[c_0_19,c_0_12]) ).
cnf(c_0_25,plain,
complement(join(zero,complement(X1))) = meet(top,X1),
inference(spm,[status(thm)],[c_0_16,c_0_21]) ).
cnf(c_0_26,plain,
meet(X1,X2) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_19]),c_0_16]) ).
cnf(c_0_27,plain,
join(top,zero) = top,
inference(spm,[status(thm)],[c_0_13,c_0_21]) ).
cnf(c_0_28,plain,
join(top,meet(X1,X2)) = join(top,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_12]),c_0_24]),c_0_18]) ).
cnf(c_0_29,plain,
meet(meet(top,X1),join(zero,complement(X1))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_25]),c_0_26]) ).
cnf(c_0_30,plain,
join(top,join(zero,X1)) = join(top,X1),
inference(spm,[status(thm)],[c_0_12,c_0_27]) ).
cnf(c_0_31,plain,
join(top,complement(complement(X1))) = join(X1,top),
inference(spm,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_32,plain,
join(top,complement(X1)) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_27]),c_0_30]) ).
cnf(c_0_33,plain,
join(X1,top) = top,
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,plain,
join(zero,meet(X1,top)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_33]),c_0_21]),c_0_19]) ).
cnf(c_0_35,plain,
join(zero,meet(top,X1)) = X1,
inference(spm,[status(thm)],[c_0_34,c_0_26]) ).
cnf(c_0_36,plain,
join(zero,zero) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_17]),c_0_21]) ).
cnf(c_0_37,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_12,c_0_36]) ).
cnf(c_0_38,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_37,c_0_35]) ).
cnf(c_0_39,plain,
complement(complement(X1)) = meet(top,X1),
inference(rw,[status(thm)],[c_0_25,c_0_38]) ).
cnf(c_0_40,plain,
meet(top,X1) = X1,
inference(rw,[status(thm)],[c_0_35,c_0_38]) ).
cnf(c_0_41,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
fof(c_0_42,negated_conjecture,
~ ! [X1,X2,X3] : join(composition(meet(X1,converse(X2)),meet(X2,X3)),composition(X1,meet(X2,X3))) = composition(X1,meet(X2,X3)),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_43,plain,
complement(join(X1,complement(X2))) = meet(complement(X1),X2),
inference(spm,[status(thm)],[c_0_16,c_0_41]) ).
cnf(c_0_44,plain,
join(zero,meet(X1,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_17]),c_0_16]) ).
fof(c_0_45,negated_conjecture,
join(composition(meet(esk1_0,converse(esk2_0)),meet(esk2_0,esk3_0)),composition(esk1_0,meet(esk2_0,esk3_0))) != composition(esk1_0,meet(esk2_0,esk3_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_42])])]) ).
cnf(c_0_46,plain,
complement(meet(complement(X1),X2)) = join(X1,complement(X2)),
inference(spm,[status(thm)],[c_0_41,c_0_43]) ).
cnf(c_0_47,plain,
meet(X1,X1) = X1,
inference(rw,[status(thm)],[c_0_44,c_0_38]) ).
cnf(c_0_48,negated_conjecture,
join(composition(meet(esk1_0,converse(esk2_0)),meet(esk2_0,esk3_0)),composition(esk1_0,meet(esk2_0,esk3_0))) != composition(esk1_0,meet(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
fof(c_0_49,plain,
! [X10,X11,X12] : composition(join(X10,X11),X12) = join(composition(X10,X12),composition(X11,X12)),
inference(variable_rename,[status(thm)],[composition_distributivity]) ).
cnf(c_0_50,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_19]),c_0_12]) ).
cnf(c_0_51,plain,
join(X1,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_41]),c_0_41]) ).
cnf(c_0_52,plain,
join(meet(X1,X2),meet(X1,complement(X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_16]),c_0_19]) ).
cnf(c_0_53,negated_conjecture,
join(composition(esk1_0,meet(esk2_0,esk3_0)),composition(meet(esk1_0,converse(esk2_0)),meet(esk2_0,esk3_0))) != composition(esk1_0,meet(esk2_0,esk3_0)),
inference(rw,[status(thm)],[c_0_48,c_0_19]) ).
cnf(c_0_54,plain,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_55,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_12]),c_0_51]) ).
cnf(c_0_56,plain,
join(meet(X1,X2),meet(complement(X2),X1)) = X1,
inference(spm,[status(thm)],[c_0_52,c_0_26]) ).
cnf(c_0_57,negated_conjecture,
composition(join(esk1_0,meet(esk1_0,converse(esk2_0))),meet(esk2_0,esk3_0)) != composition(esk1_0,meet(esk2_0,esk3_0)),
inference(rw,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_58,plain,
join(X1,meet(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_19]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : REL023+1 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n029.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 2400
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Mon Oct 2 15:29:36 EDT 2023
% 0.12/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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.4zToqxbK6e/E---3.1_10489.p
% 0.17/0.46 # Version: 3.1pre001
% 0.17/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # Starting sh5l with 300s (1) cores
% 0.17/0.46 # sh5l with pid 10570 completed with status 0
% 0.17/0.46 # Result found by sh5l
% 0.17/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # Starting sh5l with 300s (1) cores
% 0.17/0.46 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.46 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.17/0.46 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.17/0.46 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 10578 completed with status 0
% 0.17/0.46 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 0.17/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # Starting sh5l with 300s (1) cores
% 0.17/0.46 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.46 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.17/0.46 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.17/0.46 # Preprocessing time : 0.001 s
% 0.17/0.46 # Presaturation interreduction done
% 0.17/0.46
% 0.17/0.46 # Proof found!
% 0.17/0.46 # SZS status Theorem
% 0.17/0.46 # SZS output start CNFRefutation
% See solution above
% 0.17/0.46 # Parsed axioms : 14
% 0.17/0.46 # Removed by relevancy pruning/SinE : 1
% 0.17/0.46 # Initial clauses : 13
% 0.17/0.46 # Removed in clause preprocessing : 0
% 0.17/0.46 # Initial clauses in saturation : 13
% 0.17/0.46 # Processed clauses : 202
% 0.17/0.46 # ...of these trivial : 75
% 0.17/0.46 # ...subsumed : 25
% 0.17/0.46 # ...remaining for further processing : 102
% 0.17/0.46 # Other redundant clauses eliminated : 0
% 0.17/0.46 # Clauses deleted for lack of memory : 0
% 0.17/0.46 # Backward-subsumed : 0
% 0.17/0.46 # Backward-rewritten : 39
% 0.17/0.46 # Generated clauses : 1175
% 0.17/0.46 # ...of the previous two non-redundant : 825
% 0.17/0.46 # ...aggressively subsumed : 0
% 0.17/0.46 # Contextual simplify-reflections : 0
% 0.17/0.46 # Paramodulations : 1175
% 0.17/0.46 # Factorizations : 0
% 0.17/0.46 # NegExts : 0
% 0.17/0.46 # Equation resolutions : 0
% 0.17/0.46 # Total rewrite steps : 1235
% 0.17/0.46 # Propositional unsat checks : 0
% 0.17/0.46 # Propositional check models : 0
% 0.17/0.46 # Propositional check unsatisfiable : 0
% 0.17/0.46 # Propositional clauses : 0
% 0.17/0.46 # Propositional clauses after purity: 0
% 0.17/0.46 # Propositional unsat core size : 0
% 0.17/0.46 # Propositional preprocessing time : 0.000
% 0.17/0.46 # Propositional encoding time : 0.000
% 0.17/0.46 # Propositional solver time : 0.000
% 0.17/0.46 # Success case prop preproc time : 0.000
% 0.17/0.46 # Success case prop encoding time : 0.000
% 0.17/0.46 # Success case prop solver time : 0.000
% 0.17/0.46 # Current number of processed clauses : 50
% 0.17/0.46 # Positive orientable unit clauses : 46
% 0.17/0.46 # Positive unorientable unit clauses: 4
% 0.17/0.46 # Negative unit clauses : 0
% 0.17/0.46 # Non-unit-clauses : 0
% 0.17/0.46 # Current number of unprocessed clauses: 615
% 0.17/0.46 # ...number of literals in the above : 615
% 0.17/0.46 # Current number of archived formulas : 0
% 0.17/0.46 # Current number of archived clauses : 52
% 0.17/0.46 # Clause-clause subsumption calls (NU) : 0
% 0.17/0.46 # Rec. Clause-clause subsumption calls : 0
% 0.17/0.46 # Non-unit clause-clause subsumptions : 0
% 0.17/0.46 # Unit Clause-clause subsumption calls : 3
% 0.17/0.46 # Rewrite failures with RHS unbound : 0
% 0.17/0.46 # BW rewrite match attempts : 141
% 0.17/0.46 # BW rewrite match successes : 78
% 0.17/0.46 # Condensation attempts : 0
% 0.17/0.46 # Condensation successes : 0
% 0.17/0.46 # Termbank termtop insertions : 10019
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.012 s
% 0.17/0.46 # System time : 0.002 s
% 0.17/0.46 # Total time : 0.015 s
% 0.17/0.46 # Maximum resident set size: 1752 pages
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.013 s
% 0.17/0.46 # System time : 0.004 s
% 0.17/0.46 # Total time : 0.017 s
% 0.17/0.46 # Maximum resident set size: 1680 pages
% 0.17/0.46 % E---3.1 exiting
% 0.17/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------