%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM925+5 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n014.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:49 EDT 2022
% Result : Theorem 0.20s 1.39s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 38 ( 30 unt; 0 def)
% Number of atoms : 54 ( 34 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 34 ( 18 ~; 12 |; 1 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 4 con; 0-3 aty)
% Number of variables : 29 ( 1 sgn 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_0,conjecture,
power_power(int,plus_plus(int,one_one(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.mepo_128.in',conj_0) ).
fof(fact_5_zero__eq__power2,axiom,
! [X1] :
( ring_11004092258visors(X1)
=> ! [X6] :
( power_power(X1,X6,number_number_of(nat,bit0(bit1(pls)))) = zero_zero(X1)
<=> ti(X1,X6) = zero_zero(X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_5_zero__eq__power2) ).
fof(fact_78_Bit0__def,axiom,
! [X19] : bit0(X19) = plus_plus(int,X19,X19),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_78_Bit0__def) ).
fof(fact_92_Bit1__def,axiom,
! [X19] : bit1(X19) = plus_plus(int,plus_plus(int,one_one(int),X19),X19),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_92_Bit1__def) ).
fof(fact_75_add__Pls__right,axiom,
! [X19] : plus_plus(int,X19,pls) = X19,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_75_add__Pls__right) ).
fof(fact_73_Pls__def,axiom,
pls = zero_zero(int),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_73_Pls__def) ).
fof(tsy_c_Groups_Oplus__class_Oplus_0_res,axiom,
! [X2,X3,X1] :
( linord219039673up_add(X1)
=> ti(X1,plus_plus(X1,X2,X3)) = plus_plus(X1,X2,X3) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',tsy_c_Groups_Oplus__class_Oplus_0_res) ).
fof(arity_Int_Oint___Rings_Oring__1__no__zero__divisors,axiom,
ring_11004092258visors(int),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',arity_Int_Oint___Rings_Oring__1__no__zero__divisors) ).
fof(fact_0_n1pos,axiom,
ord_less(int,zero_zero(int),plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_0_n1pos) ).
fof(arity_Int_Oint___Groups_Olinordered__ab__group__add,axiom,
linord219039673up_add(int),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',arity_Int_Oint___Groups_Olinordered__ab__group__add) ).
fof(fact_32_rel__simps_I2_J,axiom,
~ ord_less(int,pls,pls),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_32_rel__simps_I2_J) ).
fof(c_0_11,negated_conjecture,
~ ( power_power(int,plus_plus(int,one_one(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,
! [X7,X8,X8] :
( ( power_power(X7,X8,number_number_of(nat,bit0(bit1(pls)))) != zero_zero(X7)
| ti(X7,X8) = zero_zero(X7)
| ~ ring_11004092258visors(X7) )
& ( ti(X7,X8) != zero_zero(X7)
| power_power(X7,X8,number_number_of(nat,bit0(bit1(pls)))) = zero_zero(X7)
| ~ ring_11004092258visors(X7) ) ),
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)],[fact_5_zero__eq__power2])])])])])]) ).
fof(c_0_13,plain,
! [X20] : bit0(X20) = plus_plus(int,X20,X20),
inference(variable_rename,[status(thm)],[fact_78_Bit0__def]) ).
fof(c_0_14,plain,
! [X20] : bit1(X20) = plus_plus(int,plus_plus(int,one_one(int),X20),X20),
inference(variable_rename,[status(thm)],[fact_92_Bit1__def]) ).
fof(c_0_15,negated_conjecture,
power_power(int,plus_plus(int,one_one(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,
( ti(X1,X2) = zero_zero(X1)
| ~ ring_11004092258visors(X1)
| power_power(X1,X2,number_number_of(nat,bit0(bit1(pls)))) != zero_zero(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
bit0(X1) = plus_plus(int,X1,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
bit1(X1) = plus_plus(int,plus_plus(int,one_one(int),X1),X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_19,plain,
! [X20] : plus_plus(int,X20,pls) = X20,
inference(variable_rename,[status(thm)],[fact_75_add__Pls__right]) ).
cnf(c_0_20,negated_conjecture,
power_power(int,plus_plus(int,one_one(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_21,plain,
( ti(X1,X2) = zero_zero(X1)
| power_power(X1,X2,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))) != zero_zero(X1)
| ~ ring_11004092258visors(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_18]) ).
cnf(c_0_22,plain,
plus_plus(int,X1,pls) = X1,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,negated_conjecture,
power_power(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))) = zero_zero(int),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_17]),c_0_18]),c_0_18]) ).
cnf(c_0_24,plain,
pls = zero_zero(int),
inference(split_conjunct,[status(thm)],[fact_73_Pls__def]) ).
fof(c_0_25,plain,
! [X4,X5,X6] :
( ~ linord219039673up_add(X6)
| ti(X6,plus_plus(X6,X4,X5)) = plus_plus(X6,X4,X5) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[tsy_c_Groups_Oplus__class_Oplus_0_res])]) ).
cnf(c_0_26,plain,
( ti(X1,X2) = zero_zero(X1)
| power_power(X1,X2,number_number_of(nat,plus_plus(int,one_one(int),one_one(int)))) != zero_zero(X1)
| ~ ring_11004092258visors(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_22]),c_0_22]),c_0_22]) ).
cnf(c_0_27,negated_conjecture,
power_power(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),number_number_of(nat,plus_plus(int,one_one(int),one_one(int)))) = pls,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_22]),c_0_22]),c_0_22]),c_0_22]),c_0_24]) ).
cnf(c_0_28,plain,
ring_11004092258visors(int),
inference(split_conjunct,[status(thm)],[arity_Int_Oint___Rings_Oring__1__no__zero__divisors]) ).
cnf(c_0_29,plain,
ord_less(int,zero_zero(int),plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),
inference(split_conjunct,[status(thm)],[fact_0_n1pos]) ).
cnf(c_0_30,plain,
( ti(X1,plus_plus(X1,X2,X3)) = plus_plus(X1,X2,X3)
| ~ linord219039673up_add(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,negated_conjecture,
ti(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n))) = pls,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_24]),c_0_24]),c_0_28])]) ).
cnf(c_0_32,plain,
linord219039673up_add(int),
inference(split_conjunct,[status(thm)],[arity_Int_Oint___Groups_Olinordered__ab__group__add]) ).
fof(c_0_33,plain,
~ ord_less(int,pls,pls),
inference(fof_simplification,[status(thm)],[fact_32_rel__simps_I2_J]) ).
cnf(c_0_34,plain,
ord_less(int,pls,plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),
inference(rw,[status(thm)],[c_0_29,c_0_24]) ).
cnf(c_0_35,negated_conjecture,
plus_plus(int,one_one(int),semiring_1_of_nat(int,n)) = pls,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_36,plain,
~ ord_less(int,pls,pls),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_37,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : NUM925+5 : TPTP v8.1.0. Released v5.3.0.
% 0.06/0.11 % Command : run_ET %s %d
% 0.11/0.32 % Computer : n014.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Wed Jul 6 17:16:22 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.20/1.39 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.20/1.39 # Preprocessing time : 0.024 s
% 0.20/1.39
% 0.20/1.39 # Proof found!
% 0.20/1.39 # SZS status Theorem
% 0.20/1.39 # SZS output start CNFRefutation
% See solution above
% 0.20/1.39 # Proof object total steps : 38
% 0.20/1.39 # Proof object clause steps : 19
% 0.20/1.39 # Proof object formula steps : 19
% 0.20/1.39 # Proof object conjectures : 8
% 0.20/1.39 # Proof object clause conjectures : 5
% 0.20/1.39 # Proof object formula conjectures : 3
% 0.20/1.39 # Proof object initial clauses used : 11
% 0.20/1.39 # Proof object initial formulas used : 11
% 0.20/1.39 # Proof object generating inferences : 2
% 0.20/1.39 # Proof object simplifying inferences : 24
% 0.20/1.39 # Training examples: 0 positive, 0 negative
% 0.20/1.39 # Parsed axioms : 153
% 0.20/1.39 # Removed by relevancy pruning/SinE : 0
% 0.20/1.39 # Initial clauses : 198
% 0.20/1.39 # Removed in clause preprocessing : 8
% 0.20/1.39 # Initial clauses in saturation : 190
% 0.20/1.39 # Processed clauses : 250
% 0.20/1.39 # ...of these trivial : 12
% 0.20/1.39 # ...subsumed : 60
% 0.20/1.39 # ...remaining for further processing : 178
% 0.20/1.39 # Other redundant clauses eliminated : 1
% 0.20/1.39 # Clauses deleted for lack of memory : 0
% 0.20/1.39 # Backward-subsumed : 0
% 0.20/1.39 # Backward-rewritten : 10
% 0.20/1.39 # Generated clauses : 2335
% 0.20/1.39 # ...of the previous two non-trivial : 1951
% 0.20/1.39 # Contextual simplify-reflections : 0
% 0.20/1.39 # Paramodulations : 2326
% 0.20/1.39 # Factorizations : 4
% 0.20/1.39 # Equation resolutions : 5
% 0.20/1.39 # Current number of processed clauses : 167
% 0.20/1.39 # Positive orientable unit clauses : 52
% 0.20/1.39 # Positive unorientable unit clauses: 4
% 0.20/1.39 # Negative unit clauses : 6
% 0.20/1.39 # Non-unit-clauses : 105
% 0.20/1.39 # Current number of unprocessed clauses: 1848
% 0.20/1.39 # ...number of literals in the above : 4815
% 0.20/1.39 # Current number of archived formulas : 0
% 0.20/1.39 # Current number of archived clauses : 12
% 0.20/1.39 # Clause-clause subsumption calls (NU) : 925
% 0.20/1.39 # Rec. Clause-clause subsumption calls : 601
% 0.20/1.39 # Non-unit clause-clause subsumptions : 25
% 0.20/1.39 # Unit Clause-clause subsumption calls : 82
% 0.20/1.39 # Rewrite failures with RHS unbound : 0
% 0.20/1.39 # BW rewrite match attempts : 120
% 0.20/1.39 # BW rewrite match successes : 30
% 0.20/1.39 # Condensation attempts : 0
% 0.20/1.39 # Condensation successes : 0
% 0.20/1.39 # Termbank termtop insertions : 56885
% 0.20/1.39
% 0.20/1.39 # -------------------------------------------------
% 0.20/1.39 # User time : 0.060 s
% 0.20/1.39 # System time : 0.005 s
% 0.20/1.39 # Total time : 0.065 s
% 0.20/1.39 # Maximum resident set size: 5164 pages
% 0.20/23.38 eprover: CPU time limit exceeded, terminating
% 0.20/23.39 eprover: CPU time limit exceeded, terminating
% 0.20/23.40 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.40 eprover: No such file or directory
% 0.20/23.40 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.40 eprover: No such file or directory
% 0.20/23.40 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.40 eprover: No such file or directory
% 0.20/23.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.41 eprover: No such file or directory
% 0.20/23.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.41 eprover: No such file or directory
% 0.20/23.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.41 eprover: No such file or directory
% 0.20/23.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.41 eprover: No such file or directory
% 0.20/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.42 eprover: No such file or directory
% 0.20/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.42 eprover: No such file or directory
% 0.20/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.42 eprover: No such file or directory
% 0.20/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.42 eprover: No such file or directory
% 0.20/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.42 eprover: No such file or directory
% 0.20/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.43 eprover: No such file or directory
% 0.20/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.43 eprover: No such file or directory
% 0.20/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.43 eprover: No such file or directory
% 0.20/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.43 eprover: No such file or directory
% 0.20/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.43 eprover: No such file or directory
% 0.20/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.44 eprover: No such file or directory
% 0.20/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.44 eprover: No such file or directory
% 0.20/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.45 eprover: No such file or directory
% 0.20/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.46 eprover: No such file or directory
% 0.20/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.46 eprover: No such file or directory
%------------------------------------------------------------------------------