TSTP Solution File: NUM926+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM926+1 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n009.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:51 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 13 unt; 0 def)
% Number of atoms : 42 ( 25 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 36 ( 18 ~; 12 |; 3 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 7 ( 3 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 8 con; 0-2 aty)
% Number of variables : 25 ( 6 sgn 10 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_0,conjecture,
? [X1,X2] : plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',conj_0) ).
fof(fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06,axiom,
( t = one_one_int
=> ? [X1,X2] : plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).
fof(fact_111_number__of__is__id,axiom,
! [X21] : number_number_of_int(X21) = X21,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_111_number__of__is__id) ).
fof(fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06,axiom,
( ord_less_int(one_one_int,t)
=> ? [X1,X2] : plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).
fof(fact_28_zless__le,axiom,
! [X17,X18] :
( ord_less_int(X17,X18)
<=> ( ord_less_eq_int(X17,X18)
& X17 != X18 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_28_zless__le) ).
fof(fact_0_tpos,axiom,
ord_less_eq_int(one_one_int,t),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_0_tpos) ).
fof(c_0_6,negated_conjecture,
~ ? [X1,X2] : plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),
inference(assume_negation,[status(cth)],[conj_0]) ).
fof(c_0_7,plain,
( t != one_one_int
| plus_plus_int(power_power_int(esk1_0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(esk2_0,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06])])])])]) ).
fof(c_0_8,plain,
! [X22] : number_number_of_int(X22) = X22,
inference(variable_rename,[status(thm)],[fact_111_number__of__is__id]) ).
fof(c_0_9,negated_conjecture,
! [X3,X4] : plus_plus_int(power_power_int(X3,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X4,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).
fof(c_0_10,plain,
( ~ ord_less_int(one_one_int,t)
| plus_plus_int(power_power_int(esk3_0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(esk4_0,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06])])])])]) ).
cnf(c_0_11,plain,
( plus_plus_int(power_power_int(esk1_0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(esk2_0,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int)
| t != one_one_int ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
number_number_of_int(X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( plus_plus_int(power_power_int(esk3_0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(esk4_0,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int)
| ~ ord_less_int(one_one_int,t) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X19,X20,X19,X20] :
( ( ord_less_eq_int(X19,X20)
| ~ ord_less_int(X19,X20) )
& ( X19 != X20
| ~ ord_less_int(X19,X20) )
& ( ~ ord_less_eq_int(X19,X20)
| X19 = X20
| ord_less_int(X19,X20) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_28_zless__le])])])])]) ).
cnf(c_0_16,plain,
( plus_plus_int(power_power_int(esk1_0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(esk2_0,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(bit0(bit0(bit1(pls))),m),one_one_int)
| t != one_one_int ),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(times_times_int(bit0(bit0(bit1(pls))),m),one_one_int),
inference(rw,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_18,plain,
( plus_plus_int(power_power_int(esk3_0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(esk4_0,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(bit0(bit0(bit1(pls))),m),one_one_int)
| ~ ord_less_int(one_one_int,t) ),
inference(rw,[status(thm)],[c_0_14,c_0_12]) ).
cnf(c_0_19,plain,
( ord_less_int(X1,X2)
| X1 = X2
| ~ ord_less_eq_int(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
ord_less_eq_int(one_one_int,t),
inference(split_conjunct,[status(thm)],[fact_0_tpos]) ).
cnf(c_0_21,plain,
one_one_int != t,
inference(sr,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
~ ord_less_int(one_one_int,t),
inference(sr,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_23,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NUM926+1 : TPTP v8.1.0. Released v5.3.0.
% 0.10/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n009.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 : Tue Jul 5 14:56:07 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.021 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 24
% 0.23/1.41 # Proof object clause steps : 12
% 0.23/1.41 # Proof object formula steps : 12
% 0.23/1.41 # Proof object conjectures : 5
% 0.23/1.41 # Proof object clause conjectures : 2
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 6
% 0.23/1.41 # Proof object initial formulas used : 6
% 0.23/1.41 # Proof object generating inferences : 1
% 0.23/1.41 # Proof object simplifying inferences : 7
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 124
% 0.23/1.41 # Removed by relevancy pruning/SinE : 23
% 0.23/1.41 # Initial clauses : 139
% 0.23/1.41 # Removed in clause preprocessing : 17
% 0.23/1.41 # Initial clauses in saturation : 122
% 0.23/1.41 # Processed clauses : 55
% 0.23/1.41 # ...of these trivial : 11
% 0.23/1.41 # ...subsumed : 2
% 0.23/1.41 # ...remaining for further processing : 42
% 0.23/1.41 # Other redundant clauses eliminated : 1
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 0
% 0.23/1.41 # Backward-rewritten : 3
% 0.23/1.41 # Generated clauses : 117
% 0.23/1.41 # ...of the previous two non-trivial : 95
% 0.23/1.41 # Contextual simplify-reflections : 0
% 0.23/1.41 # Paramodulations : 110
% 0.23/1.41 # Factorizations : 4
% 0.23/1.41 # Equation resolutions : 3
% 0.23/1.41 # Current number of processed clauses : 38
% 0.23/1.41 # Positive orientable unit clauses : 10
% 0.23/1.41 # Positive unorientable unit clauses: 5
% 0.23/1.41 # Negative unit clauses : 3
% 0.23/1.41 # Non-unit-clauses : 20
% 0.23/1.41 # Current number of unprocessed clauses: 160
% 0.23/1.41 # ...number of literals in the above : 256
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 4
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 38
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 37
% 0.23/1.41 # Non-unit clause-clause subsumptions : 0
% 0.23/1.41 # Unit Clause-clause subsumption calls : 7
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 27
% 0.23/1.41 # BW rewrite match successes : 21
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 8721
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.023 s
% 0.23/1.41 # System time : 0.002 s
% 0.23/1.41 # Total time : 0.025 s
% 0.23/1.41 # Maximum resident set size: 3340 pages
% 0.23/23.43 eprover: CPU time limit exceeded, terminating
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49 eprover: No such file or directory
%------------------------------------------------------------------------------