TSTP Solution File: RNG125+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : RNG125+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n027.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 20:27:01 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 4 unt; 0 def)
% Number of atoms : 53 ( 15 equ)
% Maximal formula atoms : 24 ( 4 avg)
% Number of connectives : 75 ( 34 ~; 22 |; 19 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn 2 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__2383,hypothesis,
~ ( ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xu,X1) = xa )
| doDivides0(xu,xa)
| aDivisorOf0(xu,xa) )
& ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xu,X1) = xb )
| doDivides0(xu,xb)
| aDivisorOf0(xu,xb) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2383) ).
fof(m__2612,hypothesis,
~ ~ ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xu,X1) = xb )
& doDivides0(xu,xb) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2612) ).
fof(m__2479,hypothesis,
~ ~ ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xu,X1) = xa )
& doDivides0(xu,xa) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2479) ).
fof(c_0_3,hypothesis,
! [X2,X3] :
( ( ~ aElement0(X3)
| sdtasdt0(xu,X3) != xb
| ~ aElement0(X2)
| sdtasdt0(xu,X2) != xa )
& ( ~ doDivides0(xu,xb)
| ~ aElement0(X2)
| sdtasdt0(xu,X2) != xa )
& ( ~ aDivisorOf0(xu,xb)
| ~ aElement0(X2)
| sdtasdt0(xu,X2) != xa )
& ( ~ aElement0(X3)
| sdtasdt0(xu,X3) != xb
| ~ doDivides0(xu,xa) )
& ( ~ doDivides0(xu,xb)
| ~ doDivides0(xu,xa) )
& ( ~ aDivisorOf0(xu,xb)
| ~ doDivides0(xu,xa) )
& ( ~ aElement0(X3)
| sdtasdt0(xu,X3) != xb
| ~ aDivisorOf0(xu,xa) )
& ( ~ doDivides0(xu,xb)
| ~ aDivisorOf0(xu,xa) )
& ( ~ aDivisorOf0(xu,xb)
| ~ aDivisorOf0(xu,xa) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__2383])])])])])]) ).
fof(c_0_4,hypothesis,
( aElement0(esk22_0)
& sdtasdt0(xu,esk22_0) = xb
& doDivides0(xu,xb) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__2612])])])])]) ).
cnf(c_0_5,hypothesis,
( sdtasdt0(xu,X1) != xa
| ~ aElement0(X1)
| ~ doDivides0(xu,xb) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,hypothesis,
doDivides0(xu,xb),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_7,hypothesis,
( aElement0(esk21_0)
& sdtasdt0(xu,esk21_0) = xa
& doDivides0(xu,xa) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__2479])])])])]) ).
cnf(c_0_8,hypothesis,
( sdtasdt0(xu,X1) != xa
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]) ).
cnf(c_0_9,hypothesis,
sdtasdt0(xu,esk21_0) = xa,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,hypothesis,
aElement0(esk21_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG125+4 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n027.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 : Mon May 30 14:57:46 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.023 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 12
% 0.24/1.42 # Proof object clause steps : 6
% 0.24/1.42 # Proof object formula steps : 6
% 0.24/1.42 # Proof object conjectures : 0
% 0.24/1.42 # Proof object clause conjectures : 0
% 0.24/1.42 # Proof object formula conjectures : 0
% 0.24/1.42 # Proof object initial clauses used : 4
% 0.24/1.42 # Proof object initial formulas used : 3
% 0.24/1.42 # Proof object generating inferences : 1
% 0.24/1.42 # Proof object simplifying inferences : 4
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 50
% 0.24/1.42 # Removed by relevancy pruning/SinE : 11
% 0.24/1.42 # Initial clauses : 171
% 0.24/1.42 # Removed in clause preprocessing : 5
% 0.24/1.42 # Initial clauses in saturation : 166
% 0.24/1.42 # Processed clauses : 71
% 0.24/1.42 # ...of these trivial : 1
% 0.24/1.42 # ...subsumed : 0
% 0.24/1.42 # ...remaining for further processing : 70
% 0.24/1.42 # Other redundant clauses eliminated : 0
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 0
% 0.24/1.42 # Backward-rewritten : 3
% 0.24/1.42 # Generated clauses : 21
% 0.24/1.42 # ...of the previous two non-trivial : 16
% 0.24/1.42 # Contextual simplify-reflections : 0
% 0.24/1.42 # Paramodulations : 20
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 1
% 0.24/1.42 # Current number of processed clauses : 67
% 0.24/1.42 # Positive orientable unit clauses : 45
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 2
% 0.24/1.42 # Non-unit-clauses : 20
% 0.24/1.42 # Current number of unprocessed clauses: 111
% 0.24/1.42 # ...number of literals in the above : 423
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 3
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 57
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 54
% 0.24/1.42 # Non-unit clause-clause subsumptions : 0
% 0.24/1.42 # Unit Clause-clause subsumption calls : 1
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 2
% 0.24/1.42 # BW rewrite match successes : 2
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 8984
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.021 s
% 0.24/1.42 # System time : 0.004 s
% 0.24/1.42 # Total time : 0.025 s
% 0.24/1.42 # Maximum resident set size: 3572 pages
%------------------------------------------------------------------------------