%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : REL001+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n012.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 : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 19:18:52 EDT 2022
% Result : Theorem 0.25s 1.43s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 41 ( 41 unt; 0 def)
% Number of atoms : 41 ( 40 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 53 ( 0 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/benchmark/Axioms/REL001+0.ax',maddux3_a_kind_of_de_Morgan) ).
fof(maddux1_join_commutativity,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux1_join_commutativity) ).
fof(def_zero,axiom,
! [X1] : zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',def_zero) ).
fof(maddux4_definiton_of_meet,axiom,
! [X1,X2] : meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux4_definiton_of_meet) ).
fof(maddux2_join_associativity,axiom,
! [X1,X2,X3] : join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux2_join_associativity) ).
fof(goals,conjecture,
! [X1] : join(zero,X1) = X1,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).
fof(c_0_6,plain,
! [X3,X4] : X3 = join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),
inference(variable_rename,[status(thm)],[maddux3_a_kind_of_de_Morgan]) ).
fof(c_0_7,plain,
! [X3,X4] : join(X3,X4) = join(X4,X3),
inference(variable_rename,[status(thm)],[maddux1_join_commutativity]) ).
fof(c_0_8,plain,
! [X2] : zero = meet(X2,complement(X2)),
inference(variable_rename,[status(thm)],[def_zero]) ).
fof(c_0_9,plain,
! [X3,X4] : meet(X3,X4) = complement(join(complement(X3),complement(X4))),
inference(variable_rename,[status(thm)],[maddux4_definiton_of_meet]) ).
cnf(c_0_10,plain,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
zero = meet(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
zero = complement(join(complement(X1),complement(complement(X1)))),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
join(zero,complement(join(complement(X1),complement(X1)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_11]) ).
cnf(c_0_17,plain,
complement(join(zero,complement(zero))) = zero,
inference(spm,[status(thm)],[c_0_15,c_0_15]) ).
fof(c_0_18,plain,
! [X4,X5,X6] : join(X4,join(X5,X6)) = join(join(X4,X5),X6),
inference(variable_rename,[status(thm)],[maddux2_join_associativity]) ).
cnf(c_0_19,plain,
join(zero,complement(join(zero,zero))) = join(zero,complement(zero)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,plain,
join(complement(join(X1,complement(X2))),complement(join(complement(X2),complement(X1)))) = X2,
inference(spm,[status(thm)],[c_0_14,c_0_11]) ).
cnf(c_0_22,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X2),complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_11]) ).
cnf(c_0_23,plain,
join(complement(X1),complement(complement(X1))) = join(zero,complement(zero)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_15]),c_0_19]) ).
cnf(c_0_24,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_11]),c_0_20]) ).
cnf(c_0_25,plain,
join(zero,complement(join(complement(zero),complement(join(zero,zero))))) = join(zero,zero),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_19]),c_0_17]),c_0_11]) ).
cnf(c_0_26,plain,
join(complement(join(zero,X1)),complement(join(zero,complement(X1)))) = join(zero,complement(zero)),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_27,plain,
join(zero,complement(join(X1,complement(complement(X1))))) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_17]),c_0_11]),c_0_11]) ).
cnf(c_0_28,plain,
join(zero,join(X1,complement(join(complement(zero),complement(join(zero,zero)))))) = join(X1,join(zero,zero)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
inference(spm,[status(thm)],[c_0_11,c_0_20]) ).
cnf(c_0_30,plain,
join(zero,complement(zero)) = complement(zero),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_17]),c_0_27]) ).
cnf(c_0_31,plain,
join(zero,join(zero,complement(join(zero,join(zero,complement(zero)))))) = join(zero,zero),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_14]),c_0_29]),c_0_11]),c_0_29]),c_0_11]) ).
cnf(c_0_32,plain,
complement(complement(zero)) = zero,
inference(rw,[status(thm)],[c_0_17,c_0_30]) ).
cnf(c_0_33,plain,
join(zero,join(zero,zero)) = join(zero,zero),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_30]),c_0_30]),c_0_32]) ).
fof(c_0_34,negated_conjecture,
~ ! [X1] : join(zero,X1) = X1,
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_35,plain,
join(zero,join(zero,join(zero,X1))) = join(zero,join(zero,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_33]),c_0_20]),c_0_20]) ).
fof(c_0_36,negated_conjecture,
join(zero,esk1_0) != esk1_0,
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])])]) ).
cnf(c_0_37,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_35,c_0_16]) ).
cnf(c_0_38,negated_conjecture,
join(zero,esk1_0) != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_39,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_37,c_0_16]) ).
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.04/0.13 % Problem : REL001+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Fri Jul 8 11:04:29 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.25/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.43 # Preprocessing time : 0.014 s
% 0.25/1.43
% 0.25/1.43 # Proof found!
% 0.25/1.43 # SZS status Theorem
% 0.25/1.43 # SZS output start CNFRefutation
% See solution above
% 0.25/1.43 # Proof object total steps : 41
% 0.25/1.43 # Proof object clause steps : 28
% 0.25/1.43 # Proof object formula steps : 13
% 0.25/1.43 # Proof object conjectures : 5
% 0.25/1.43 # Proof object clause conjectures : 2
% 0.25/1.43 # Proof object formula conjectures : 3
% 0.25/1.43 # Proof object initial clauses used : 6
% 0.25/1.43 # Proof object initial formulas used : 6
% 0.25/1.43 # Proof object generating inferences : 17
% 0.25/1.43 # Proof object simplifying inferences : 23
% 0.25/1.43 # Training examples: 0 positive, 0 negative
% 0.25/1.43 # Parsed axioms : 14
% 0.25/1.43 # Removed by relevancy pruning/SinE : 2
% 0.25/1.43 # Initial clauses : 12
% 0.25/1.43 # Removed in clause preprocessing : 1
% 0.25/1.43 # Initial clauses in saturation : 11
% 0.25/1.43 # Processed clauses : 210
% 0.25/1.43 # ...of these trivial : 84
% 0.25/1.43 # ...subsumed : 46
% 0.25/1.43 # ...remaining for further processing : 80
% 0.25/1.43 # Other redundant clauses eliminated : 0
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 0
% 0.25/1.43 # Backward-rewritten : 52
% 0.25/1.43 # Generated clauses : 1985
% 0.25/1.43 # ...of the previous two non-trivial : 1722
% 0.25/1.43 # Contextual simplify-reflections : 0
% 0.25/1.43 # Paramodulations : 1985
% 0.25/1.43 # Factorizations : 0
% 0.25/1.43 # Equation resolutions : 0
% 0.25/1.43 # Current number of processed clauses : 28
% 0.25/1.43 # Positive orientable unit clauses : 23
% 0.25/1.43 # Positive unorientable unit clauses: 5
% 0.25/1.43 # Negative unit clauses : 0
% 0.25/1.43 # Non-unit-clauses : 0
% 0.25/1.43 # Current number of unprocessed clauses: 557
% 0.25/1.43 # ...number of literals in the above : 557
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 53
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 0
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 0
% 0.25/1.43 # Non-unit clause-clause subsumptions : 0
% 0.25/1.43 # Unit Clause-clause subsumption calls : 45
% 0.25/1.43 # Rewrite failures with RHS unbound : 3
% 0.25/1.43 # BW rewrite match attempts : 370
% 0.25/1.43 # BW rewrite match successes : 194
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 33246
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.048 s
% 0.25/1.43 # System time : 0.005 s
% 0.25/1.43 # Total time : 0.053 s
% 0.25/1.43 # Maximum resident set size: 4396 pages
%------------------------------------------------------------------------------