TSTP Solution File: MSC012+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : MSC012+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n015.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:43:01 EDT 2022
% Result : Theorem 0.21s 1.39s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 10 unt; 0 def)
% Number of atoms : 57 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 55 ( 24 ~; 24 |; 5 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 39 ( 2 sgn 14 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(transitive_less,axiom,
! [X1,X2,X3] :
( ( less(X1,X2)
& less(X2,X3) )
=> less(X1,X3) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',transitive_less) ).
fof(serial_less,axiom,
! [X1] :
? [X2] : less(X1,X2),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',serial_less) ).
fof(goal_to_be_proved,conjecture,
goal,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goal_to_be_proved) ).
fof(left_to_right,axiom,
! [X1,X2] :
( ( p(X1)
& less(X1,X2)
& p(X2) )
=> goal ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',left_to_right) ).
fof(right_to_left,axiom,
! [X1] :
( p(X1)
| ? [X2] :
( less(X1,X2)
& p(X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',right_to_left) ).
fof(c_0_5,plain,
! [X4,X5,X6] :
( ~ less(X4,X5)
| ~ less(X5,X6)
| less(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitive_less])]) ).
fof(c_0_6,plain,
! [X3] : less(X3,esk2_1(X3)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[serial_less])]) ).
fof(c_0_7,negated_conjecture,
~ goal,
inference(assume_negation,[status(cth)],[goal_to_be_proved]) ).
cnf(c_0_8,plain,
( less(X1,X2)
| ~ less(X3,X2)
| ~ less(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
less(X1,esk2_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X3,X4] :
( ~ p(X3)
| ~ less(X3,X4)
| ~ p(X4)
| goal ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[left_to_right])])])]) ).
fof(c_0_11,negated_conjecture,
~ goal,
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
! [X3] :
( ( less(X3,esk1_1(X3))
| p(X3) )
& ( p(esk1_1(X3))
| p(X3) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[right_to_left])])])])]) ).
cnf(c_0_13,plain,
( less(X1,esk2_1(X2))
| ~ less(X1,X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,plain,
( goal
| ~ p(X1)
| ~ less(X2,X1)
| ~ p(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
~ goal,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( p(X1)
| less(X1,esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( less(X1,esk2_1(X2))
| ~ less(X1,X3)
| ~ less(X3,X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_13]) ).
cnf(c_0_18,plain,
( ~ less(X1,X2)
| ~ p(X1)
| ~ p(X2) ),
inference(sr,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( less(X1,esk1_1(X2))
| p(X2)
| ~ less(X1,X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_16]) ).
cnf(c_0_20,plain,
( p(X1)
| p(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
( less(X1,esk2_1(X2))
| ~ less(esk2_1(X1),X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_9]) ).
cnf(c_0_22,plain,
( ~ less(X1,X2)
| ~ p(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_18]) ).
cnf(c_0_23,plain,
less(X1,esk2_1(esk2_1(esk2_1(X1)))),
inference(spm,[status(thm)],[c_0_21,c_0_9]) ).
cnf(c_0_24,plain,
~ p(X1),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_20,c_0_24]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : MSC012+1 : TPTP v8.1.0. Released v3.2.0.
% 0.02/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n015.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jul 1 16:54:13 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.21/1.39 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.39 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.39 # Preprocessing time : 0.008 s
% 0.21/1.39
% 0.21/1.39 # Proof found!
% 0.21/1.39 # SZS status Theorem
% 0.21/1.39 # SZS output start CNFRefutation
% See solution above
% 0.21/1.39 # Proof object total steps : 26
% 0.21/1.39 # Proof object clause steps : 15
% 0.21/1.39 # Proof object formula steps : 11
% 0.21/1.39 # Proof object conjectures : 4
% 0.21/1.39 # Proof object clause conjectures : 1
% 0.21/1.39 # Proof object formula conjectures : 3
% 0.21/1.39 # Proof object initial clauses used : 6
% 0.21/1.39 # Proof object initial formulas used : 5
% 0.21/1.39 # Proof object generating inferences : 7
% 0.21/1.39 # Proof object simplifying inferences : 5
% 0.21/1.39 # Training examples: 0 positive, 0 negative
% 0.21/1.39 # Parsed axioms : 5
% 0.21/1.39 # Removed by relevancy pruning/SinE : 0
% 0.21/1.39 # Initial clauses : 6
% 0.21/1.39 # Removed in clause preprocessing : 0
% 0.21/1.39 # Initial clauses in saturation : 6
% 0.21/1.39 # Processed clauses : 21
% 0.21/1.39 # ...of these trivial : 0
% 0.21/1.39 # ...subsumed : 1
% 0.21/1.39 # ...remaining for further processing : 20
% 0.21/1.39 # Other redundant clauses eliminated : 0
% 0.21/1.39 # Clauses deleted for lack of memory : 0
% 0.21/1.39 # Backward-subsumed : 2
% 0.21/1.39 # Backward-rewritten : 0
% 0.21/1.39 # Generated clauses : 49
% 0.21/1.39 # ...of the previous two non-trivial : 45
% 0.21/1.39 # Contextual simplify-reflections : 3
% 0.21/1.39 # Paramodulations : 47
% 0.21/1.39 # Factorizations : 0
% 0.21/1.39 # Equation resolutions : 0
% 0.21/1.39 # Current number of processed clauses : 16
% 0.21/1.39 # Positive orientable unit clauses : 4
% 0.21/1.39 # Positive unorientable unit clauses: 0
% 0.21/1.39 # Negative unit clauses : 2
% 0.21/1.39 # Non-unit-clauses : 10
% 0.21/1.39 # Current number of unprocessed clauses: 26
% 0.21/1.39 # ...number of literals in the above : 58
% 0.21/1.39 # Current number of archived formulas : 0
% 0.21/1.39 # Current number of archived clauses : 4
% 0.21/1.39 # Clause-clause subsumption calls (NU) : 40
% 0.21/1.39 # Rec. Clause-clause subsumption calls : 28
% 0.21/1.39 # Non-unit clause-clause subsumptions : 6
% 0.21/1.39 # Unit Clause-clause subsumption calls : 3
% 0.21/1.39 # Rewrite failures with RHS unbound : 0
% 0.21/1.39 # BW rewrite match attempts : 5
% 0.21/1.39 # BW rewrite match successes : 0
% 0.21/1.39 # Condensation attempts : 0
% 0.21/1.39 # Condensation successes : 0
% 0.21/1.39 # Termbank termtop insertions : 875
% 0.21/1.39
% 0.21/1.39 # -------------------------------------------------
% 0.21/1.39 # User time : 0.008 s
% 0.21/1.39 # System time : 0.001 s
% 0.21/1.39 # Total time : 0.009 s
% 0.21/1.39 # Maximum resident set size: 2764 pages
%------------------------------------------------------------------------------