TSTP Solution File: REL049+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : REL049+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n025.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:29 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 12 unt; 0 def)
% Number of atoms : 21 ( 20 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 10 ( 4 ~; 0 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X1,X2,X3] :
( ( join(X1,X2) = X2
& join(X3,X2) = X2 )
=> join(join(X1,X3),X2) = X2 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).
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(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(c_0_3,negated_conjecture,
~ ! [X1,X2,X3] :
( ( join(X1,X2) = X2
& join(X3,X2) = X2 )
=> join(join(X1,X3),X2) = X2 ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_4,negated_conjecture,
( join(esk1_0,esk2_0) = esk2_0
& join(esk3_0,esk2_0) = esk2_0
& join(join(esk1_0,esk3_0),esk2_0) != esk2_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_5,plain,
! [X3,X4] : join(X3,X4) = join(X4,X3),
inference(variable_rename,[status(thm)],[maddux1_join_commutativity]) ).
fof(c_0_6,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_7,negated_conjecture,
join(join(esk1_0,esk3_0),esk2_0) != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
join(esk2_0,join(esk1_0,esk3_0)) != esk2_0,
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
join(esk3_0,esk2_0) = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
join(esk1_0,esk2_0) = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : REL049+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n025.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 : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jul 8 15:46:15 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42 # Preprocessing time : 0.014 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 15
% 0.23/1.42 # Proof object clause steps : 8
% 0.23/1.42 # Proof object formula steps : 7
% 0.23/1.42 # Proof object conjectures : 8
% 0.23/1.42 # Proof object clause conjectures : 5
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 5
% 0.23/1.42 # Proof object initial formulas used : 3
% 0.23/1.42 # Proof object generating inferences : 1
% 0.23/1.42 # Proof object simplifying inferences : 5
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 14
% 0.23/1.42 # Removed by relevancy pruning/SinE : 11
% 0.23/1.42 # Initial clauses : 5
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 5
% 0.23/1.42 # Processed clauses : 12
% 0.23/1.42 # ...of these trivial : 1
% 0.23/1.42 # ...subsumed : 0
% 0.23/1.42 # ...remaining for further processing : 11
% 0.23/1.42 # Other redundant clauses eliminated : 0
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 0
% 0.23/1.42 # Backward-rewritten : 2
% 0.23/1.42 # Generated clauses : 67
% 0.23/1.42 # ...of the previous two non-trivial : 15
% 0.23/1.42 # Contextual simplify-reflections : 0
% 0.23/1.42 # Paramodulations : 67
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 0
% 0.23/1.42 # Current number of processed clauses : 9
% 0.23/1.42 # Positive orientable unit clauses : 7
% 0.23/1.42 # Positive unorientable unit clauses: 2
% 0.23/1.42 # Negative unit clauses : 0
% 0.23/1.42 # Non-unit-clauses : 0
% 0.23/1.42 # Current number of unprocessed clauses: 8
% 0.23/1.42 # ...number of literals in the above : 8
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 2
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 0
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 0
% 0.23/1.42 # Non-unit clause-clause subsumptions : 0
% 0.23/1.42 # Unit Clause-clause subsumption calls : 1
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 16
% 0.23/1.42 # BW rewrite match successes : 16
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 771
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.012 s
% 0.23/1.42 # System time : 0.003 s
% 0.23/1.42 # Total time : 0.015 s
% 0.23/1.42 # Maximum resident set size: 2812 pages
%------------------------------------------------------------------------------