TSTP Solution File: NUM926+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM926+1 : TPTP v8.1.2. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:58:02 EDT 2023
% Result : Theorem 0.17s 0.48s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 40 ( 26 unt; 0 def)
% Number of atoms : 61 ( 44 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 46 ( 25 ~; 15 |; 3 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 46 ( 9 sgn; 18 !; 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/sandbox2/tmp/tmp.tv9siHmxot/E---3.1_23904.p',conj_0) ).
fof(fact_111_number__of__is__id,axiom,
! [X21] : number_number_of_int(X21) = X21,
file('/export/starexec/sandbox2/tmp/tmp.tv9siHmxot/E---3.1_23904.p',fact_111_number__of__is__id) ).
fof(fact_102_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J,axiom,
! [X82,X83] : plus_plus_int(X82,X83) = plus_plus_int(X83,X82),
file('/export/starexec/sandbox2/tmp/tmp.tv9siHmxot/E---3.1_23904.p',fact_102_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J) ).
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/sandbox2/tmp/tmp.tv9siHmxot/E---3.1_23904.p',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_90_comm__semiring__1__class_Onormalizing__semiring__rules_I7_J,axiom,
! [X64,X65] : times_times_int(X64,X65) = times_times_int(X65,X64),
file('/export/starexec/sandbox2/tmp/tmp.tv9siHmxot/E---3.1_23904.p',fact_90_comm__semiring__1__class_Onormalizing__semiring__rules_I7_J) ).
fof(fact_16_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J,axiom,
! [X8] : times_times_int(X8,X8) = power_power_int(X8,number_number_of_nat(bit0(bit1(pls)))),
file('/export/starexec/sandbox2/tmp/tmp.tv9siHmxot/E---3.1_23904.p',fact_16_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J) ).
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/sandbox2/tmp/tmp.tv9siHmxot/E---3.1_23904.p',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/sandbox2/tmp/tmp.tv9siHmxot/E---3.1_23904.p',fact_28_zless__le) ).
fof(fact_0_tpos,axiom,
ord_less_eq_int(one_one_int,t),
file('/export/starexec/sandbox2/tmp/tmp.tv9siHmxot/E---3.1_23904.p',fact_0_tpos) ).
fof(c_0_9,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_10,negated_conjecture,
! [X87,X88] : plus_plus_int(power_power_int(X87,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X88,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_9])]) ).
fof(c_0_11,plain,
! [X189] : number_number_of_int(X189) = X189,
inference(variable_rename,[status(thm)],[fact_111_number__of__is__id]) ).
cnf(c_0_12,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_10]) ).
cnf(c_0_13,plain,
number_number_of_int(X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X115,X116] : plus_plus_int(X115,X116) = plus_plus_int(X116,X115),
inference(variable_rename,[status(thm)],[fact_102_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J]) ).
fof(c_0_15,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(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])])]) ).
cnf(c_0_16,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_12,c_0_13]) ).
cnf(c_0_17,plain,
plus_plus_int(X1,X2) = plus_plus_int(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_18,plain,
! [X157,X158] : times_times_int(X157,X158) = times_times_int(X158,X157),
inference(variable_rename,[status(thm)],[fact_90_comm__semiring__1__class_Onormalizing__semiring__rules_I7_J]) ).
cnf(c_0_19,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_15]) ).
fof(c_0_20,plain,
! [X209] : times_times_int(X209,X209) = power_power_int(X209,number_number_of_nat(bit0(bit1(pls)))),
inference(variable_rename,[status(thm)],[fact_16_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J]) ).
cnf(c_0_21,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(one_one_int,times_times_int(bit0(bit0(bit1(pls))),m)),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
times_times_int(X1,X2) = times_times_int(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,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_19,c_0_13]) ).
cnf(c_0_24,plain,
times_times_int(X1,X1) = power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,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(one_one_int,times_times_int(m,bit0(bit0(bit1(pls))))),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( plus_plus_int(times_times_int(bit0(bit0(bit1(pls))),m),one_one_int) = plus_plus_int(times_times_int(esk1_0,esk1_0),times_times_int(esk2_0,esk2_0))
| t != one_one_int ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_24]) ).
fof(c_0_27,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(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_28,negated_conjecture,
plus_plus_int(times_times_int(X1,X1),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(bit1(pls))))),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_29,plain,
( plus_plus_int(times_times_int(esk1_0,esk1_0),times_times_int(esk2_0,esk2_0)) = plus_plus_int(one_one_int,times_times_int(bit0(bit0(bit1(pls))),m))
| t != one_one_int ),
inference(rw,[status(thm)],[c_0_26,c_0_17]) ).
cnf(c_0_30,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_27]) ).
fof(c_0_31,plain,
! [X227,X228] :
( ( ord_less_eq_int(X227,X228)
| ~ ord_less_int(X227,X228) )
& ( X227 != X228
| ~ ord_less_int(X227,X228) )
& ( ~ ord_less_eq_int(X227,X228)
| X227 = X228
| ord_less_int(X227,X228) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_28_zless__le])])]) ).
cnf(c_0_32,negated_conjecture,
plus_plus_int(times_times_int(X1,X1),times_times_int(X2,X2)) != plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(bit1(pls))))),
inference(spm,[status(thm)],[c_0_28,c_0_24]) ).
cnf(c_0_33,plain,
( plus_plus_int(times_times_int(esk1_0,esk1_0),times_times_int(esk2_0,esk2_0)) = plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(bit1(pls)))))
| t != one_one_int ),
inference(rw,[status(thm)],[c_0_29,c_0_22]) ).
cnf(c_0_34,plain,
( plus_plus_int(times_times_int(esk3_0,esk3_0),times_times_int(esk4_0,esk4_0)) = plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(bit1(pls)))))
| ~ ord_less_int(one_one_int,t) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_24]),c_0_24]),c_0_13]),c_0_22]),c_0_17]) ).
cnf(c_0_35,plain,
( X1 = X2
| ord_less_int(X1,X2)
| ~ ord_less_eq_int(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_36,plain,
ord_less_eq_int(one_one_int,t),
inference(split_conjunct,[status(thm)],[fact_0_tpos]) ).
cnf(c_0_37,negated_conjecture,
t != one_one_int,
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,negated_conjecture,
~ ord_less_int(one_one_int,t),
inference(spm,[status(thm)],[c_0_32,c_0_34]) ).
cnf(c_0_39,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : NUM926+1 : TPTP v8.1.2. Released v5.3.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n032.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 2400
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon Oct 2 13:36:04 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.17/0.45 Running first-order theorem proving
% 0.17/0.45 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.tv9siHmxot/E---3.1_23904.p
% 0.17/0.48 # Version: 3.1pre001
% 0.17/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.48 # Starting sh5l with 300s (1) cores
% 0.17/0.48 # new_bool_1 with pid 23986 completed with status 0
% 0.17/0.48 # Result found by new_bool_1
% 0.17/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.48 # Search class: FGHSM-FFMS21-DFFFFFNN
% 0.17/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.48 # Starting new_ho_10 with 55s (1) cores
% 0.17/0.48 # new_ho_10 with pid 23988 completed with status 0
% 0.17/0.48 # Result found by new_ho_10
% 0.17/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.48 # Search class: FGHSM-FFMS21-DFFFFFNN
% 0.17/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.48 # Starting new_ho_10 with 55s (1) cores
% 0.17/0.48 # Preprocessing time : 0.002 s
% 0.17/0.48 # Presaturation interreduction done
% 0.17/0.48
% 0.17/0.48 # Proof found!
% 0.17/0.48 # SZS status Theorem
% 0.17/0.48 # SZS output start CNFRefutation
% See solution above
% 0.17/0.48 # Parsed axioms : 124
% 0.17/0.48 # Removed by relevancy pruning/SinE : 20
% 0.17/0.48 # Initial clauses : 142
% 0.17/0.48 # Removed in clause preprocessing : 7
% 0.17/0.48 # Initial clauses in saturation : 135
% 0.17/0.48 # Processed clauses : 244
% 0.17/0.48 # ...of these trivial : 26
% 0.17/0.48 # ...subsumed : 39
% 0.17/0.48 # ...remaining for further processing : 179
% 0.17/0.48 # Other redundant clauses eliminated : 1
% 0.17/0.48 # Clauses deleted for lack of memory : 0
% 0.17/0.48 # Backward-subsumed : 3
% 0.17/0.48 # Backward-rewritten : 9
% 0.17/0.48 # Generated clauses : 274
% 0.17/0.48 # ...of the previous two non-redundant : 236
% 0.17/0.48 # ...aggressively subsumed : 0
% 0.17/0.48 # Contextual simplify-reflections : 0
% 0.17/0.48 # Paramodulations : 271
% 0.17/0.48 # Factorizations : 0
% 0.17/0.48 # NegExts : 0
% 0.17/0.48 # Equation resolutions : 3
% 0.17/0.48 # Total rewrite steps : 195
% 0.17/0.48 # Propositional unsat checks : 0
% 0.17/0.48 # Propositional check models : 0
% 0.17/0.48 # Propositional check unsatisfiable : 0
% 0.17/0.48 # Propositional clauses : 0
% 0.17/0.48 # Propositional clauses after purity: 0
% 0.17/0.48 # Propositional unsat core size : 0
% 0.17/0.48 # Propositional preprocessing time : 0.000
% 0.17/0.48 # Propositional encoding time : 0.000
% 0.17/0.48 # Propositional solver time : 0.000
% 0.17/0.48 # Success case prop preproc time : 0.000
% 0.17/0.48 # Success case prop encoding time : 0.000
% 0.17/0.48 # Success case prop solver time : 0.000
% 0.17/0.48 # Current number of processed clauses : 85
% 0.17/0.48 # Positive orientable unit clauses : 23
% 0.17/0.48 # Positive unorientable unit clauses: 7
% 0.17/0.48 # Negative unit clauses : 11
% 0.17/0.48 # Non-unit-clauses : 44
% 0.17/0.48 # Current number of unprocessed clauses: 195
% 0.17/0.48 # ...number of literals in the above : 281
% 0.17/0.48 # Current number of archived formulas : 0
% 0.17/0.48 # Current number of archived clauses : 93
% 0.17/0.48 # Clause-clause subsumption calls (NU) : 700
% 0.17/0.48 # Rec. Clause-clause subsumption calls : 654
% 0.17/0.48 # Non-unit clause-clause subsumptions : 21
% 0.17/0.48 # Unit Clause-clause subsumption calls : 205
% 0.17/0.48 # Rewrite failures with RHS unbound : 0
% 0.17/0.48 # BW rewrite match attempts : 140
% 0.17/0.48 # BW rewrite match successes : 118
% 0.17/0.48 # Condensation attempts : 244
% 0.17/0.48 # Condensation successes : 0
% 0.17/0.48 # Termbank termtop insertions : 11243
% 0.17/0.48
% 0.17/0.48 # -------------------------------------------------
% 0.17/0.48 # User time : 0.018 s
% 0.17/0.48 # System time : 0.003 s
% 0.17/0.48 # Total time : 0.021 s
% 0.17/0.48 # Maximum resident set size: 2272 pages
% 0.17/0.48
% 0.17/0.48 # -------------------------------------------------
% 0.17/0.48 # User time : 0.020 s
% 0.17/0.48 # System time : 0.007 s
% 0.17/0.48 # Total time : 0.027 s
% 0.17/0.48 # Maximum resident set size: 1856 pages
% 0.17/0.48 % E---3.1 exiting
% 0.17/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------