TSTP Solution File: NUN073+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUN073+1 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n019.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 16:26:04 EDT 2022
% Result : Theorem 0.26s 1.44s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 7 unt; 0 def)
% Number of atoms : 51 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 69 ( 36 ~; 28 |; 5 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 34 ( 1 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(oneunidtwo,conjecture,
! [X63] :
( ! [X46] :
( ! [X40] :
( ~ r1(X40)
| ~ r2(X40,X46) )
| ~ id(X46,X63) )
| ! [X47] :
( ! [X41] :
( ~ r1(X41)
| ~ r2(X41,X47) )
| ~ r2(X47,X63) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',oneunidtwo) ).
fof(axiom_7a,axiom,
! [X65,X66] :
( ! [X67] :
( ~ id(X67,X66)
| ~ r1(X67) )
| ~ r2(X65,X66) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax',axiom_7a) ).
fof(axiom_3a,axiom,
! [X50,X51] :
( ! [X52] :
( ! [X53] :
( ~ id(X53,X52)
| ~ r2(X50,X53) )
| ~ r2(X51,X52) )
| id(X50,X51) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax',axiom_3a) ).
fof(c_0_3,negated_conjecture,
~ ! [X63] :
( ! [X46] :
( ! [X40] :
( ~ r1(X40)
| ~ r2(X40,X46) )
| ~ id(X46,X63) )
| ! [X47] :
( ! [X41] :
( ~ r1(X41)
| ~ r2(X41,X47) )
| ~ r2(X47,X63) ) ),
inference(assume_negation,[status(cth)],[oneunidtwo]) ).
fof(c_0_4,plain,
! [X68,X69,X70] :
( ~ id(X70,X69)
| ~ r1(X70)
| ~ r2(X68,X69) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_7a])])])])]) ).
fof(c_0_5,negated_conjecture,
( r1(esk3_0)
& r2(esk3_0,esk2_0)
& id(esk2_0,esk1_0)
& r1(esk5_0)
& r2(esk5_0,esk4_0)
& r2(esk4_0,esk1_0) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_3])])])])])]) ).
fof(c_0_6,plain,
! [X54,X55,X56,X57] :
( ~ id(X57,X56)
| ~ r2(X54,X57)
| ~ r2(X55,X56)
| id(X54,X55) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_3a])])])])]) ).
cnf(c_0_7,plain,
( ~ r2(X1,X2)
| ~ r1(X3)
| ~ id(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
r2(esk5_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( id(X1,X2)
| ~ r2(X2,X3)
| ~ r2(X1,X4)
| ~ id(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
r2(esk4_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
( ~ r1(X1)
| ~ id(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
r1(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
( id(X1,esk4_0)
| ~ r2(X1,X2)
| ~ id(X2,esk1_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
r2(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,negated_conjecture,
id(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
~ id(esk3_0,esk4_0),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : NUN073+1 : TPTP v8.1.0. Released v7.3.0.
% 0.04/0.14 % Command : run_ET %s %d
% 0.14/0.36 % Computer : n019.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Thu Jun 2 07:28:55 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.26/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.44 # Preprocessing time : 0.017 s
% 0.26/1.44
% 0.26/1.44 # Proof found!
% 0.26/1.44 # SZS status Theorem
% 0.26/1.44 # SZS output start CNFRefutation
% See solution above
% 0.26/1.44 # Proof object total steps : 18
% 0.26/1.44 # Proof object clause steps : 11
% 0.26/1.44 # Proof object formula steps : 7
% 0.26/1.44 # Proof object conjectures : 12
% 0.26/1.44 # Proof object clause conjectures : 9
% 0.26/1.44 # Proof object formula conjectures : 3
% 0.26/1.44 # Proof object initial clauses used : 7
% 0.26/1.44 # Proof object initial formulas used : 3
% 0.26/1.44 # Proof object generating inferences : 4
% 0.26/1.44 # Proof object simplifying inferences : 3
% 0.26/1.44 # Training examples: 0 positive, 0 negative
% 0.26/1.44 # Parsed axioms : 19
% 0.26/1.44 # Removed by relevancy pruning/SinE : 0
% 0.26/1.44 # Initial clauses : 64
% 0.26/1.44 # Removed in clause preprocessing : 16
% 0.26/1.44 # Initial clauses in saturation : 48
% 0.26/1.44 # Processed clauses : 426
% 0.26/1.44 # ...of these trivial : 0
% 0.26/1.44 # ...subsumed : 162
% 0.26/1.44 # ...remaining for further processing : 264
% 0.26/1.44 # Other redundant clauses eliminated : 0
% 0.26/1.44 # Clauses deleted for lack of memory : 0
% 0.26/1.44 # Backward-subsumed : 0
% 0.26/1.44 # Backward-rewritten : 0
% 0.26/1.44 # Generated clauses : 1106
% 0.26/1.44 # ...of the previous two non-trivial : 905
% 0.26/1.44 # Contextual simplify-reflections : 0
% 0.26/1.44 # Paramodulations : 1106
% 0.26/1.44 # Factorizations : 0
% 0.26/1.44 # Equation resolutions : 0
% 0.26/1.44 # Current number of processed clauses : 264
% 0.26/1.44 # Positive orientable unit clauses : 101
% 0.26/1.44 # Positive unorientable unit clauses: 0
% 0.26/1.44 # Negative unit clauses : 45
% 0.26/1.44 # Non-unit-clauses : 118
% 0.26/1.44 # Current number of unprocessed clauses: 527
% 0.26/1.44 # ...number of literals in the above : 1378
% 0.26/1.44 # Current number of archived formulas : 0
% 0.26/1.44 # Current number of archived clauses : 0
% 0.26/1.44 # Clause-clause subsumption calls (NU) : 2149
% 0.26/1.44 # Rec. Clause-clause subsumption calls : 1768
% 0.26/1.44 # Non-unit clause-clause subsumptions : 49
% 0.26/1.44 # Unit Clause-clause subsumption calls : 2477
% 0.26/1.44 # Rewrite failures with RHS unbound : 0
% 0.26/1.44 # BW rewrite match attempts : 22
% 0.26/1.44 # BW rewrite match successes : 0
% 0.26/1.44 # Condensation attempts : 0
% 0.26/1.44 # Condensation successes : 0
% 0.26/1.44 # Termbank termtop insertions : 12215
% 0.26/1.44
% 0.26/1.44 # -------------------------------------------------
% 0.26/1.44 # User time : 0.037 s
% 0.26/1.44 # System time : 0.005 s
% 0.26/1.44 # Total time : 0.042 s
% 0.26/1.44 # Maximum resident set size: 3860 pages
%------------------------------------------------------------------------------