TSTP Solution File: MGT052+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : MGT052+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n021.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 : Sun Jul 17 22:10:14 EDT 2022
% Result : Theorem 0.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 10 ( 6 unt; 0 def)
% Number of atoms : 32 ( 0 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 40 ( 18 ~; 15 |; 5 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 19 ( 3 sgn 13 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(background_assumption_1,conjecture,
! [X1,X5] : ~ dissimilar(X1,X5,X5),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',background_assumption_1) ).
fof(definition_2,axiom,
! [X1,X4,X5] :
( dissimilar(X1,X4,X5)
<=> ( organization(X1)
& ~ ( is_aligned(X1,X4)
<=> is_aligned(X1,X5) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',definition_2) ).
fof(c_0_2,negated_conjecture,
~ ! [X1,X5] : ~ dissimilar(X1,X5,X5),
inference(assume_negation,[status(cth)],[background_assumption_1]) ).
fof(c_0_3,plain,
! [X6,X7,X8,X6,X7,X8] :
( ( organization(X6)
| ~ dissimilar(X6,X7,X8) )
& ( ~ is_aligned(X6,X7)
| ~ is_aligned(X6,X8)
| ~ dissimilar(X6,X7,X8) )
& ( is_aligned(X6,X7)
| is_aligned(X6,X8)
| ~ dissimilar(X6,X7,X8) )
& ( ~ is_aligned(X6,X7)
| is_aligned(X6,X8)
| ~ organization(X6)
| dissimilar(X6,X7,X8) )
& ( ~ is_aligned(X6,X8)
| is_aligned(X6,X7)
| ~ organization(X6)
| dissimilar(X6,X7,X8) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[definition_2])])])])]) ).
fof(c_0_4,negated_conjecture,
dissimilar(esk1_0,esk2_0,esk2_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_2])])])]) ).
cnf(c_0_5,plain,
( ~ dissimilar(X1,X2,X3)
| ~ is_aligned(X1,X3)
| ~ is_aligned(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
dissimilar(esk1_0,esk2_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( is_aligned(X1,X3)
| is_aligned(X1,X2)
| ~ dissimilar(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
~ is_aligned(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_6]),c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT052+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n021.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 : Thu Jun 9 11:33:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.21/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.40 # Preprocessing time : 0.013 s
% 0.21/1.40
% 0.21/1.40 # Failure: Out of unprocessed clauses!
% 0.21/1.40 # OLD status GaveUp
% 0.21/1.40 # Parsed axioms : 8
% 0.21/1.40 # Removed by relevancy pruning/SinE : 7
% 0.21/1.40 # Initial clauses : 1
% 0.21/1.40 # Removed in clause preprocessing : 0
% 0.21/1.40 # Initial clauses in saturation : 1
% 0.21/1.40 # Processed clauses : 1
% 0.21/1.40 # ...of these trivial : 0
% 0.21/1.40 # ...subsumed : 0
% 0.21/1.40 # ...remaining for further processing : 1
% 0.21/1.40 # Other redundant clauses eliminated : 0
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 0
% 0.21/1.40 # Backward-rewritten : 0
% 0.21/1.40 # Generated clauses : 0
% 0.21/1.40 # ...of the previous two non-trivial : 0
% 0.21/1.40 # Contextual simplify-reflections : 0
% 0.21/1.40 # Paramodulations : 0
% 0.21/1.40 # Factorizations : 0
% 0.21/1.40 # Equation resolutions : 0
% 0.21/1.40 # Current number of processed clauses : 1
% 0.21/1.40 # Positive orientable unit clauses : 1
% 0.21/1.40 # Positive unorientable unit clauses: 0
% 0.21/1.40 # Negative unit clauses : 0
% 0.21/1.40 # Non-unit-clauses : 0
% 0.21/1.40 # Current number of unprocessed clauses: 0
% 0.21/1.40 # ...number of literals in the above : 0
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 0
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 0
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 0
% 0.21/1.40 # Non-unit clause-clause subsumptions : 0
% 0.21/1.40 # Unit Clause-clause subsumption calls : 0
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 0
% 0.21/1.40 # BW rewrite match successes : 0
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 118
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.011 s
% 0.21/1.40 # System time : 0.002 s
% 0.21/1.40 # Total time : 0.013 s
% 0.21/1.40 # Maximum resident set size: 2544 pages
% 0.21/1.40 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.21/1.40 # Preprocessing time : 0.015 s
% 0.21/1.40
% 0.21/1.40 # Proof found!
% 0.21/1.40 # SZS status Theorem
% 0.21/1.40 # SZS output start CNFRefutation
% See solution above
% 0.21/1.40 # Proof object total steps : 10
% 0.21/1.40 # Proof object clause steps : 5
% 0.21/1.40 # Proof object formula steps : 5
% 0.21/1.40 # Proof object conjectures : 6
% 0.21/1.40 # Proof object clause conjectures : 3
% 0.21/1.40 # Proof object formula conjectures : 3
% 0.21/1.40 # Proof object initial clauses used : 3
% 0.21/1.40 # Proof object initial formulas used : 2
% 0.21/1.40 # Proof object generating inferences : 2
% 0.21/1.40 # Proof object simplifying inferences : 1
% 0.21/1.40 # Training examples: 0 positive, 0 negative
% 0.21/1.40 # Parsed axioms : 8
% 0.21/1.40 # Removed by relevancy pruning/SinE : 0
% 0.21/1.40 # Initial clauses : 17
% 0.21/1.40 # Removed in clause preprocessing : 0
% 0.21/1.40 # Initial clauses in saturation : 17
% 0.21/1.40 # Processed clauses : 20
% 0.21/1.40 # ...of these trivial : 0
% 0.21/1.40 # ...subsumed : 0
% 0.21/1.40 # ...remaining for further processing : 19
% 0.21/1.40 # Other redundant clauses eliminated : 2
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 0
% 0.21/1.40 # Backward-rewritten : 0
% 0.21/1.40 # Generated clauses : 11
% 0.21/1.40 # ...of the previous two non-trivial : 8
% 0.21/1.40 # Contextual simplify-reflections : 0
% 0.21/1.40 # Paramodulations : 9
% 0.21/1.40 # Factorizations : 0
% 0.21/1.40 # Equation resolutions : 2
% 0.21/1.40 # Current number of processed clauses : 17
% 0.21/1.40 # Positive orientable unit clauses : 2
% 0.21/1.40 # Positive unorientable unit clauses: 0
% 0.21/1.40 # Negative unit clauses : 1
% 0.21/1.40 # Non-unit-clauses : 14
% 0.21/1.40 # Current number of unprocessed clauses: 5
% 0.21/1.40 # ...number of literals in the above : 11
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 0
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 9
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 9
% 0.21/1.40 # Non-unit clause-clause subsumptions : 0
% 0.21/1.40 # Unit Clause-clause subsumption calls : 3
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 0
% 0.21/1.40 # BW rewrite match successes : 0
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 983
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.014 s
% 0.21/1.40 # System time : 0.002 s
% 0.21/1.40 # Total time : 0.016 s
% 0.21/1.40 # Maximum resident set size: 2808 pages
%------------------------------------------------------------------------------