TSTP Solution File: NUM926+5 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM926+5 : TPTP v8.2.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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 : 300s
% DateTime : Tue May 21 01:28:37 EDT 2024
% Result : Theorem 0.20s 0.53s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 30 ( 20 unt; 0 def)
% Number of atoms : 48 ( 30 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 36 ( 18 ~; 10 |; 4 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 9 con; 0-3 aty)
% Number of variables : 39 ( 6 sgn 18 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_0,conjecture,
? [X4,X5] : plus_plus(int,power_power(int,X4,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X5,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/benchmark/theBenchmark.p',conj_0) ).
fof(fact_86_number__of__is__id,axiom,
! [X18] : number_number_of(int,X18) = X18,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_86_number__of__is__id) ).
fof(fact_89_zadd__commute,axiom,
! [X15,X11] : plus_plus(int,X15,X11) = plus_plus(int,X11,X15),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_89_zadd__commute) ).
fof(fact_85_zmult__commute,axiom,
! [X15,X11] : times_times(int,X15,X11) = times_times(int,X11,X15),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_85_zmult__commute) ).
fof(fact_22_zless__le,axiom,
! [X16,X17] :
( ord_less(int,X16,X17)
<=> ( ord_less_eq(int,X16,X17)
& X16 != X17 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_22_zless__le) ).
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)
=> ? [X4,X5] : plus_plus(int,power_power(int,X4,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X5,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/benchmark/theBenchmark.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_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)
=> ? [X4,X5] : plus_plus(int,power_power(int,X4,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X5,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/benchmark/theBenchmark.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_0_tpos,axiom,
ord_less_eq(int,one_one(int),t),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_tpos) ).
fof(c_0_8,negated_conjecture,
~ ? [X4,X5] : plus_plus(int,power_power(int,X4,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X5,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_9,negated_conjecture,
! [X48,X49] : plus_plus(int,power_power(int,X48,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X49,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(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_10,plain,
! [X180] : number_number_of(int,X180) = X180,
inference(variable_rename,[status(thm)],[fact_86_number__of__is__id]) ).
cnf(c_0_11,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_12,plain,
number_number_of(int,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X129,X130] : plus_plus(int,X129,X130) = plus_plus(int,X130,X129),
inference(variable_rename,[status(thm)],[fact_89_zadd__commute]) ).
fof(c_0_14,plain,
! [X174,X175] : times_times(int,X174,X175) = times_times(int,X175,X174),
inference(variable_rename,[status(thm)],[fact_85_zmult__commute]) ).
fof(c_0_15,plain,
! [X16,X17] :
( ord_less(int,X16,X17)
<=> ( ord_less_eq(int,X16,X17)
& X16 != X17 ) ),
inference(fof_simplification,[status(thm)],[fact_22_zless__le]) ).
fof(c_0_16,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(fof_nnf,[status(thm)],[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_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_11,c_0_12]) ).
cnf(c_0_18,plain,
plus_plus(int,X1,X2) = plus_plus(int,X2,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
times_times(int,X1,X2) = times_times(int,X2,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_20,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(fof_nnf,[status(thm)],[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])])])]) ).
fof(c_0_21,plain,
! [X205,X206] :
( ( ord_less_eq(int,X205,X206)
| ~ ord_less(int,X205,X206) )
& ( X205 != X206
| ~ ord_less(int,X205,X206) )
& ( ~ ord_less_eq(int,X205,X206)
| X205 = X206
| ord_less(int,X205,X206) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])]) ).
cnf(c_0_22,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_16]) ).
cnf(c_0_23,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)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_24,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_20]) ).
cnf(c_0_25,plain,
( X1 = X2
| ord_less(int,X1,X2)
| ~ ord_less_eq(int,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
ord_less_eq(int,one_one(int),t),
inference(split_conjunct,[status(thm)],[fact_0_tpos]) ).
cnf(c_0_27,plain,
one_one(int) != t,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_12]),c_0_19]),c_0_18]),c_0_23]) ).
cnf(c_0_28,plain,
~ ord_less(int,one_one(int),t),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_12]),c_0_19]),c_0_18]),c_0_23]) ).
cnf(c_0_29,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUM926+5 : TPTP v8.2.0. Released v5.3.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n028.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 07:02:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.53 # Version: 3.1.0
% 0.20/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 # Starting sh5l with 300s (1) cores
% 0.20/0.53 # new_bool_1 with pid 29838 completed with status 0
% 0.20/0.53 # Result found by new_bool_1
% 0.20/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.53 # Search class: FGHSM-FFLM32-DFFFFFNN
% 0.20/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 62s (1) cores
% 0.20/0.53 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 29840 completed with status 0
% 0.20/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.20/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.53 # Search class: FGHSM-FFLM32-DFFFFFNN
% 0.20/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 62s (1) cores
% 0.20/0.53 # Preprocessing time : 0.004 s
% 0.20/0.53 # Presaturation interreduction done
% 0.20/0.53
% 0.20/0.53 # Proof found!
% 0.20/0.53 # SZS status Theorem
% 0.20/0.53 # SZS output start CNFRefutation
% See solution above
% 0.20/0.53 # Parsed axioms : 142
% 0.20/0.53 # Removed by relevancy pruning/SinE : 48
% 0.20/0.53 # Initial clauses : 126
% 0.20/0.53 # Removed in clause preprocessing : 2
% 0.20/0.53 # Initial clauses in saturation : 124
% 0.20/0.53 # Processed clauses : 187
% 0.20/0.53 # ...of these trivial : 7
% 0.20/0.53 # ...subsumed : 26
% 0.20/0.53 # ...remaining for further processing : 154
% 0.20/0.53 # Other redundant clauses eliminated : 1
% 0.20/0.53 # Clauses deleted for lack of memory : 0
% 0.20/0.53 # Backward-subsumed : 1
% 0.20/0.53 # Backward-rewritten : 10
% 0.20/0.53 # Generated clauses : 60
% 0.20/0.53 # ...of the previous two non-redundant : 43
% 0.20/0.53 # ...aggressively subsumed : 0
% 0.20/0.53 # Contextual simplify-reflections : 0
% 0.20/0.53 # Paramodulations : 56
% 0.20/0.53 # Factorizations : 0
% 0.20/0.53 # NegExts : 0
% 0.20/0.53 # Equation resolutions : 4
% 0.20/0.53 # Disequality decompositions : 0
% 0.20/0.53 # Total rewrite steps : 70
% 0.20/0.53 # ...of those cached : 25
% 0.20/0.53 # Propositional unsat checks : 0
% 0.20/0.53 # Propositional check models : 0
% 0.20/0.53 # Propositional check unsatisfiable : 0
% 0.20/0.53 # Propositional clauses : 0
% 0.20/0.53 # Propositional clauses after purity: 0
% 0.20/0.53 # Propositional unsat core size : 0
% 0.20/0.53 # Propositional preprocessing time : 0.000
% 0.20/0.53 # Propositional encoding time : 0.000
% 0.20/0.53 # Propositional solver time : 0.000
% 0.20/0.53 # Success case prop preproc time : 0.000
% 0.20/0.53 # Success case prop encoding time : 0.000
% 0.20/0.53 # Success case prop solver time : 0.000
% 0.20/0.53 # Current number of processed clauses : 46
% 0.20/0.53 # Positive orientable unit clauses : 14
% 0.20/0.53 # Positive unorientable unit clauses: 5
% 0.20/0.53 # Negative unit clauses : 6
% 0.20/0.53 # Non-unit-clauses : 21
% 0.20/0.53 # Current number of unprocessed clauses: 70
% 0.20/0.53 # ...number of literals in the above : 130
% 0.20/0.53 # Current number of archived formulas : 0
% 0.20/0.53 # Current number of archived clauses : 107
% 0.20/0.53 # Clause-clause subsumption calls (NU) : 389
% 0.20/0.53 # Rec. Clause-clause subsumption calls : 345
% 0.20/0.53 # Non-unit clause-clause subsumptions : 24
% 0.20/0.53 # Unit Clause-clause subsumption calls : 14
% 0.20/0.53 # Rewrite failures with RHS unbound : 0
% 0.20/0.53 # BW rewrite match attempts : 58
% 0.20/0.53 # BW rewrite match successes : 30
% 0.20/0.53 # Condensation attempts : 0
% 0.20/0.53 # Condensation successes : 0
% 0.20/0.53 # Termbank termtop insertions : 11356
% 0.20/0.53 # Search garbage collected termcells : 1344
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.024 s
% 0.20/0.53 # System time : 0.004 s
% 0.20/0.53 # Total time : 0.028 s
% 0.20/0.53 # Maximum resident set size: 2296 pages
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.029 s
% 0.20/0.53 # System time : 0.007 s
% 0.20/0.53 # Total time : 0.036 s
% 0.20/0.53 # Maximum resident set size: 1896 pages
% 0.20/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------