TSTP Solution File: REL046+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : REL046+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n016.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:20:27 EDT 2022
% Result : Theorem 0.26s 1.43s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 21 unt; 0 def)
% Number of atoms : 32 ( 31 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 13 ( 6 ~; 2 |; 3 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X1,X2,X3] :
( join(X1,meet(X2,X3)) = meet(X2,X3)
=> ( join(X1,X2) = X2
& join(X1,X3) = X3 ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).
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(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(c_0_5,negated_conjecture,
~ ! [X1,X2,X3] :
( join(X1,meet(X2,X3)) = meet(X2,X3)
=> ( join(X1,X2) = X2
& join(X1,X3) = X3 ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_6,negated_conjecture,
( join(esk1_0,meet(esk2_0,esk3_0)) = meet(esk2_0,esk3_0)
& ( join(esk1_0,esk2_0) != esk2_0
| join(esk1_0,esk3_0) != esk3_0 ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_7,plain,
! [X3,X4] : meet(X3,X4) = complement(join(complement(X3),complement(X4))),
inference(variable_rename,[status(thm)],[maddux4_definiton_of_meet]) ).
fof(c_0_8,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_9,negated_conjecture,
join(esk1_0,meet(esk2_0,esk3_0)) = meet(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,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_12,plain,
! [X3,X4] : join(X3,X4) = join(X4,X3),
inference(variable_rename,[status(thm)],[maddux1_join_commutativity]) ).
cnf(c_0_13,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
join(esk1_0,complement(join(complement(esk2_0),complement(esk3_0)))) = complement(join(complement(esk2_0),complement(esk3_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_10]) ).
cnf(c_0_15,plain,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
join(esk1_0,join(complement(join(complement(esk2_0),complement(esk3_0))),X1)) = join(complement(join(complement(esk2_0),complement(esk3_0))),X1),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( join(esk1_0,esk3_0) != esk3_0
| join(esk1_0,esk2_0) != esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,negated_conjecture,
join(esk1_0,esk2_0) = esk2_0,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
join(esk1_0,join(X1,complement(join(complement(esk2_0),complement(esk3_0))))) = join(X1,complement(join(complement(esk2_0),complement(esk3_0)))),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_22,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X2),complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_23,negated_conjecture,
join(esk1_0,esk3_0) != esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : REL046+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.14 % Command : run_ET %s %d
% 0.15/0.35 % Computer : n016.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Fri Jul 8 10:57:08 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.26/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.43 # Preprocessing time : 0.014 s
% 0.26/1.43
% 0.26/1.43 # Proof found!
% 0.26/1.43 # SZS status Theorem
% 0.26/1.43 # SZS output start CNFRefutation
% See solution above
% 0.26/1.43 # Proof object total steps : 25
% 0.26/1.43 # Proof object clause steps : 14
% 0.26/1.43 # Proof object formula steps : 11
% 0.26/1.43 # Proof object conjectures : 11
% 0.26/1.43 # Proof object clause conjectures : 8
% 0.26/1.43 # Proof object formula conjectures : 3
% 0.26/1.43 # Proof object initial clauses used : 6
% 0.26/1.43 # Proof object initial formulas used : 5
% 0.26/1.43 # Proof object generating inferences : 5
% 0.26/1.43 # Proof object simplifying inferences : 6
% 0.26/1.43 # Training examples: 0 positive, 0 negative
% 0.26/1.43 # Parsed axioms : 14
% 0.26/1.43 # Removed by relevancy pruning/SinE : 3
% 0.26/1.43 # Initial clauses : 12
% 0.26/1.43 # Removed in clause preprocessing : 1
% 0.26/1.43 # Initial clauses in saturation : 11
% 0.26/1.43 # Processed clauses : 56
% 0.26/1.43 # ...of these trivial : 15
% 0.26/1.43 # ...subsumed : 10
% 0.26/1.43 # ...remaining for further processing : 31
% 0.26/1.43 # Other redundant clauses eliminated : 0
% 0.26/1.43 # Clauses deleted for lack of memory : 0
% 0.26/1.43 # Backward-subsumed : 0
% 0.26/1.43 # Backward-rewritten : 2
% 0.26/1.43 # Generated clauses : 442
% 0.26/1.43 # ...of the previous two non-trivial : 344
% 0.26/1.43 # Contextual simplify-reflections : 0
% 0.26/1.43 # Paramodulations : 442
% 0.26/1.43 # Factorizations : 0
% 0.26/1.43 # Equation resolutions : 0
% 0.26/1.43 # Current number of processed clauses : 29
% 0.26/1.43 # Positive orientable unit clauses : 25
% 0.26/1.43 # Positive unorientable unit clauses: 3
% 0.26/1.43 # Negative unit clauses : 1
% 0.26/1.43 # Non-unit-clauses : 0
% 0.26/1.43 # Current number of unprocessed clauses: 282
% 0.26/1.43 # ...number of literals in the above : 282
% 0.26/1.43 # Current number of archived formulas : 0
% 0.26/1.43 # Current number of archived clauses : 3
% 0.26/1.43 # Clause-clause subsumption calls (NU) : 0
% 0.26/1.43 # Rec. Clause-clause subsumption calls : 0
% 0.26/1.43 # Non-unit clause-clause subsumptions : 0
% 0.26/1.43 # Unit Clause-clause subsumption calls : 10
% 0.26/1.43 # Rewrite failures with RHS unbound : 0
% 0.26/1.43 # BW rewrite match attempts : 30
% 0.26/1.43 # BW rewrite match successes : 25
% 0.26/1.43 # Condensation attempts : 0
% 0.26/1.43 # Condensation successes : 0
% 0.26/1.43 # Termbank termtop insertions : 6232
% 0.26/1.43
% 0.26/1.43 # -------------------------------------------------
% 0.26/1.43 # User time : 0.021 s
% 0.26/1.43 # System time : 0.001 s
% 0.26/1.43 # Total time : 0.023 s
% 0.26/1.43 # Maximum resident set size: 3076 pages
%------------------------------------------------------------------------------