TSTP Solution File: NUM925+7 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM925+7 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n011.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 09:37:50 EDT 2022
% Result : Theorem 0.37s 1.55s
% Output : CNFRefutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of formulae : 36 ( 33 unt; 0 def)
% Number of atoms : 42 ( 24 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 16 ( 10 ~; 4 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 6 con; 0-4 aty)
% Number of variables : 18 ( 1 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_0,conjecture,
hAPP(nat,int,power_power(int,plus_plus(int,one_one(int),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,bit0(bit1(pls)))) != zero_zero(int),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',conj_0) ).
fof(fact_514_succ__Bit0,axiom,
! [X20] : succ(bit0(X20)) = bit1(X20),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_514_succ__Bit0) ).
fof(fact_78_Bit0__def,axiom,
! [X20] : bit0(X20) = plus_plus(int,X20,X20),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_78_Bit0__def) ).
fof(fact_777_diff__bin__simps_I2_J,axiom,
! [X20] : minus_minus(int,X20,min) = succ(X20),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_777_diff__bin__simps_I2_J) ).
fof(fact_29_nat__1__add__1,axiom,
plus_plus(nat,one_one(nat),one_one(nat)) = number_number_of(nat,bit0(bit1(pls))),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_29_nat__1__add__1) ).
fof(fact_72_Bit0__Pls,axiom,
bit0(pls) = pls,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_72_Bit0__Pls) ).
fof(fact_179_zero__less__power,axiom,
! [X2] :
( linordered_semidom(X2)
=> ! [X15,X31] :
( hBOOL(hAPP(X2,bool,hAPP(X2,fun(X2,bool),ord_less(X2),zero_zero(X2)),X31))
=> hBOOL(hAPP(X2,bool,hAPP(X2,fun(X2,bool),ord_less(X2),zero_zero(X2)),hAPP(nat,X2,power_power(X2,X31),X15))) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_179_zero__less__power) ).
fof(fact_73_Pls__def,axiom,
pls = zero_zero(int),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_73_Pls__def) ).
fof(fact_0_n1pos,axiom,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),zero_zero(int)),plus_plus(int,one_one(int),hAPP(nat,int,semiring_1_of_nat(int),n)))),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_0_n1pos) ).
fof(fact_32_rel__simps_I2_J,axiom,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),pls),pls)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_32_rel__simps_I2_J) ).
fof(arity_Int_Oint___Rings_Olinordered__semidom,axiom,
linordered_semidom(int),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',arity_Int_Oint___Rings_Olinordered__semidom) ).
fof(c_0_11,negated_conjecture,
~ ( hAPP(nat,int,power_power(int,plus_plus(int,one_one(int),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,bit0(bit1(pls)))) != zero_zero(int) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
fof(c_0_12,plain,
! [X21] : succ(bit0(X21)) = bit1(X21),
inference(variable_rename,[status(thm)],[fact_514_succ__Bit0]) ).
fof(c_0_13,plain,
! [X21] : bit0(X21) = plus_plus(int,X21,X21),
inference(variable_rename,[status(thm)],[fact_78_Bit0__def]) ).
fof(c_0_14,plain,
! [X21] : minus_minus(int,X21,min) = succ(X21),
inference(variable_rename,[status(thm)],[fact_777_diff__bin__simps_I2_J]) ).
fof(c_0_15,negated_conjecture,
hAPP(nat,int,power_power(int,plus_plus(int,one_one(int),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,bit0(bit1(pls)))) = zero_zero(int),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
plus_plus(nat,one_one(nat),one_one(nat)) = number_number_of(nat,bit0(bit1(pls))),
inference(split_conjunct,[status(thm)],[fact_29_nat__1__add__1]) ).
cnf(c_0_17,plain,
succ(bit0(X1)) = bit1(X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
bit0(X1) = plus_plus(int,X1,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
minus_minus(int,X1,min) = succ(X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
bit0(pls) = pls,
inference(split_conjunct,[status(thm)],[fact_72_Bit0__Pls]) ).
cnf(c_0_21,negated_conjecture,
hAPP(nat,int,power_power(int,plus_plus(int,one_one(int),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,bit0(bit1(pls)))) = zero_zero(int),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
plus_plus(nat,one_one(nat),one_one(nat)) = number_number_of(nat,plus_plus(int,minus_minus(int,plus_plus(int,pls,pls),min),minus_minus(int,plus_plus(int,pls,pls),min))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_18]),c_0_19]),c_0_19]) ).
cnf(c_0_23,plain,
plus_plus(int,pls,pls) = pls,
inference(rw,[status(thm)],[c_0_20,c_0_18]) ).
fof(c_0_24,plain,
! [X32,X33,X34] :
( ~ linordered_semidom(X32)
| ~ hBOOL(hAPP(X32,bool,hAPP(X32,fun(X32,bool),ord_less(X32),zero_zero(X32)),X34))
| hBOOL(hAPP(X32,bool,hAPP(X32,fun(X32,bool),ord_less(X32),zero_zero(X32)),hAPP(nat,X32,power_power(X32,X34),X33))) ),
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)],[fact_179_zero__less__power])])])])]) ).
cnf(c_0_25,negated_conjecture,
hAPP(nat,int,power_power(int,plus_plus(int,one_one(int),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,plus_plus(int,minus_minus(int,plus_plus(int,pls,pls),min),minus_minus(int,plus_plus(int,pls,pls),min)))) = zero_zero(int),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_17]),c_0_18]),c_0_18]),c_0_19]),c_0_19]) ).
cnf(c_0_26,plain,
number_number_of(nat,plus_plus(int,minus_minus(int,pls,min),minus_minus(int,pls,min))) = plus_plus(nat,one_one(nat),one_one(nat)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_23]) ).
cnf(c_0_27,plain,
pls = zero_zero(int),
inference(split_conjunct,[status(thm)],[fact_73_Pls__def]) ).
cnf(c_0_28,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),zero_zero(int)),plus_plus(int,one_one(int),hAPP(nat,int,semiring_1_of_nat(int),n)))),
inference(split_conjunct,[status(thm)],[fact_0_n1pos]) ).
fof(c_0_29,plain,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),pls),pls)),
inference(fof_simplification,[status(thm)],[fact_32_rel__simps_I2_J]) ).
cnf(c_0_30,plain,
( hBOOL(hAPP(X1,bool,hAPP(X1,fun(X1,bool),ord_less(X1),zero_zero(X1)),hAPP(nat,X1,power_power(X1,X2),X3)))
| ~ hBOOL(hAPP(X1,bool,hAPP(X1,fun(X1,bool),ord_less(X1),zero_zero(X1)),X2))
| ~ linordered_semidom(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,negated_conjecture,
hAPP(nat,int,power_power(int,plus_plus(int,one_one(int),hAPP(nat,int,semiring_1_of_nat(int),n))),plus_plus(nat,one_one(nat),one_one(nat))) = pls,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_23]),c_0_23]),c_0_26]),c_0_27]) ).
cnf(c_0_32,plain,
linordered_semidom(int),
inference(split_conjunct,[status(thm)],[arity_Int_Oint___Rings_Olinordered__semidom]) ).
cnf(c_0_33,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),pls),plus_plus(int,one_one(int),hAPP(nat,int,semiring_1_of_nat(int),n)))),
inference(rw,[status(thm)],[c_0_28,c_0_27]) ).
cnf(c_0_34,plain,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),pls),pls)),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_27]),c_0_32]),c_0_27]),c_0_33])]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM925+7 : TPTP v8.1.0. Released v5.3.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n011.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jul 7 04:49:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.37/1.55 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.37/1.55 # Preprocessing time : 0.183 s
% 0.37/1.55
% 0.37/1.55 # Proof found!
% 0.37/1.55 # SZS status Theorem
% 0.37/1.55 # SZS output start CNFRefutation
% See solution above
% 0.37/1.55 # Proof object total steps : 36
% 0.37/1.55 # Proof object clause steps : 18
% 0.37/1.55 # Proof object formula steps : 18
% 0.37/1.55 # Proof object conjectures : 7
% 0.37/1.55 # Proof object clause conjectures : 4
% 0.37/1.55 # Proof object formula conjectures : 3
% 0.37/1.55 # Proof object initial clauses used : 11
% 0.37/1.55 # Proof object initial formulas used : 11
% 0.37/1.55 # Proof object generating inferences : 1
% 0.37/1.55 # Proof object simplifying inferences : 24
% 0.37/1.55 # Training examples: 0 positive, 0 negative
% 0.37/1.55 # Parsed axioms : 1251
% 0.37/1.55 # Removed by relevancy pruning/SinE : 0
% 0.37/1.55 # Initial clauses : 1729
% 0.37/1.55 # Removed in clause preprocessing : 83
% 0.37/1.55 # Initial clauses in saturation : 1646
% 0.37/1.55 # Processed clauses : 1502
% 0.37/1.55 # ...of these trivial : 22
% 0.37/1.55 # ...subsumed : 187
% 0.37/1.55 # ...remaining for further processing : 1293
% 0.37/1.55 # Other redundant clauses eliminated : 50
% 0.37/1.55 # Clauses deleted for lack of memory : 0
% 0.37/1.55 # Backward-subsumed : 6
% 0.37/1.55 # Backward-rewritten : 70
% 0.37/1.55 # Generated clauses : 43997
% 0.37/1.55 # ...of the previous two non-trivial : 41189
% 0.37/1.55 # Contextual simplify-reflections : 38
% 0.37/1.55 # Paramodulations : 43918
% 0.37/1.55 # Factorizations : 12
% 0.37/1.55 # Equation resolutions : 67
% 0.37/1.55 # Current number of processed clauses : 1201
% 0.37/1.55 # Positive orientable unit clauses : 293
% 0.37/1.55 # Positive unorientable unit clauses: 14
% 0.37/1.55 # Negative unit clauses : 16
% 0.37/1.55 # Non-unit-clauses : 878
% 0.37/1.55 # Current number of unprocessed clauses: 40864
% 0.37/1.55 # ...number of literals in the above : 113935
% 0.37/1.55 # Current number of archived formulas : 0
% 0.37/1.55 # Current number of archived clauses : 79
% 0.37/1.55 # Clause-clause subsumption calls (NU) : 139097
% 0.37/1.55 # Rec. Clause-clause subsumption calls : 94209
% 0.37/1.55 # Non-unit clause-clause subsumptions : 219
% 0.37/1.55 # Unit Clause-clause subsumption calls : 1402
% 0.37/1.55 # Rewrite failures with RHS unbound : 0
% 0.37/1.55 # BW rewrite match attempts : 2352
% 0.37/1.55 # BW rewrite match successes : 141
% 0.37/1.55 # Condensation attempts : 0
% 0.37/1.55 # Condensation successes : 0
% 0.37/1.55 # Termbank termtop insertions : 1781432
% 0.37/1.55
% 0.37/1.55 # -------------------------------------------------
% 0.37/1.55 # User time : 0.852 s
% 0.37/1.55 # System time : 0.031 s
% 0.37/1.55 # Total time : 0.883 s
% 0.37/1.55 # Maximum resident set size: 50176 pages
% 0.37/23.54 eprover: CPU time limit exceeded, terminating
% 0.37/23.55 eprover: CPU time limit exceeded, terminating
% 0.37/23.56 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.37/23.56 eprover: No such file or directory
% 0.37/23.57 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.37/23.57 eprover: No such file or directory
% 0.37/23.57 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.37/23.57 eprover: No such file or directory
% 0.37/23.58 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.37/23.58 eprover: No such file or directory
% 0.37/23.58 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.37/23.58 eprover: No such file or directory
% 0.37/23.59 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.37/23.59 eprover: No such file or directory
% 0.37/23.60 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.37/23.60 eprover: No such file or directory
% 0.37/23.60 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.37/23.60 eprover: No such file or directory
% 0.37/23.61 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.37/23.61 eprover: No such file or directory
% 0.37/23.61 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.37/23.61 eprover: No such file or directory
% 0.37/23.62 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.37/23.62 eprover: No such file or directory
% 0.37/23.70 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.37/23.70 eprover: No such file or directory
% 0.37/23.71 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.37/23.71 eprover: No such file or directory
% 0.37/23.71 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.37/23.71 eprover: No such file or directory
% 0.37/23.71 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.37/23.71 eprover: No such file or directory
% 0.37/23.72 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.37/23.72 eprover: No such file or directory
% 0.37/23.72 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.37/23.72 eprover: No such file or directory
% 0.37/23.73 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.37/23.73 eprover: No such file or directory
% 0.37/23.73 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.37/23.73 eprover: No such file or directory
% 0.37/23.73 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.37/23.73 eprover: No such file or directory
% 0.37/23.74 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.37/23.74 eprover: No such file or directory
% 0.37/23.74 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.37/23.74 eprover: No such file or directory
%------------------------------------------------------------------------------