TSTP Solution File: NUM924+7 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM924+7 : TPTP v8.1.2. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:57:58 EDT 2023
% Result : Theorem 0.48s 1.02s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 40 ( 40 unt; 0 def)
% Number of atoms : 40 ( 31 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 13 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 7 con; 0-4 aty)
% Number of variables : 26 ( 1 sgn; 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(tsy_c_Int_OBit0_res,hypothesis,
! [X4] : ti(int,bit0(X4)) = bit0(X4),
file('/export/starexec/sandbox2/tmp/tmp.fkZBm4c3tU/E---3.1_27757.p',tsy_c_Int_OBit0_res) ).
fof(fact_22_number__of__is__id,axiom,
! [X15] : number_number_of(int,X15) = ti(int,X15),
file('/export/starexec/sandbox2/tmp/tmp.fkZBm4c3tU/E---3.1_27757.p',fact_22_number__of__is__id) ).
fof(fact_23_zmult__commute,axiom,
! [X16,X12] : hAPP(int,int,times_times(int,X16),X12) = hAPP(int,int,times_times(int,X12),X16),
file('/export/starexec/sandbox2/tmp/tmp.fkZBm4c3tU/E---3.1_27757.p',fact_23_zmult__commute) ).
fof(fact_98_zadd__commute,axiom,
! [X16,X12] : hAPP(int,int,plus_plus(int,X16),X12) = hAPP(int,int,plus_plus(int,X12),X16),
file('/export/starexec/sandbox2/tmp/tmp.fkZBm4c3tU/E---3.1_27757.p',fact_98_zadd__commute) ).
fof(tsy_c_Int_OBit1_res,hypothesis,
! [X4] : ti(int,bit1(X4)) = bit1(X4),
file('/export/starexec/sandbox2/tmp/tmp.fkZBm4c3tU/E---3.1_27757.p',tsy_c_Int_OBit1_res) ).
fof(fact_3_t,axiom,
hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int)) = hAPP(int,int,times_times(int,hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int))),t),
file('/export/starexec/sandbox2/tmp/tmp.fkZBm4c3tU/E---3.1_27757.p',fact_3_t) ).
fof(conj_0,conjecture,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int))),zero_zero(int))),
file('/export/starexec/sandbox2/tmp/tmp.fkZBm4c3tU/E---3.1_27757.p',conj_0) ).
fof(fact_751__096sum2sq_A_Is_M_A1_J_A_061_A_I4_A_K_Am_A_L_A1_J_A_K_At_096,axiom,
twoSqu1929807760sum2sq(product_Pair(int,int,s,one_one(int))) = hAPP(int,int,times_times(int,hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int))),t),
file('/export/starexec/sandbox2/tmp/tmp.fkZBm4c3tU/E---3.1_27757.p',fact_751__096sum2sq_A_Is_M_A1_J_A_061_A_I4_A_K_Am_A_L_A1_J_A_K_At_096) ).
fof(fact_62_mult__Pls,axiom,
! [X12] : hAPP(int,int,times_times(int,pls),X12) = pls,
file('/export/starexec/sandbox2/tmp/tmp.fkZBm4c3tU/E---3.1_27757.p',fact_62_mult__Pls) ).
fof(fact_122_Pls__def,axiom,
pls = zero_zero(int),
file('/export/starexec/sandbox2/tmp/tmp.fkZBm4c3tU/E---3.1_27757.p',fact_122_Pls__def) ).
fof(fact_111_one__is__num__one,axiom,
one_one(int) = number_number_of(int,bit1(pls)),
file('/export/starexec/sandbox2/tmp/tmp.fkZBm4c3tU/E---3.1_27757.p',fact_111_one__is__num__one) ).
fof(fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096,axiom,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,times_times(int,hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int))),t)),hAPP(int,int,times_times(int,hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int))),zero_zero(int)))),
file('/export/starexec/sandbox2/tmp/tmp.fkZBm4c3tU/E---3.1_27757.p',fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096) ).
fof(c_0_12,hypothesis,
! [X998] : ti(int,bit0(X998)) = bit0(X998),
inference(variable_rename,[status(thm)],[tsy_c_Int_OBit0_res]) ).
fof(c_0_13,plain,
! [X1001] : number_number_of(int,X1001) = ti(int,X1001),
inference(variable_rename,[status(thm)],[fact_22_number__of__is__id]) ).
cnf(c_0_14,hypothesis,
ti(int,bit0(X1)) = bit0(X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
number_number_of(int,X1) = ti(int,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,plain,
! [X755,X756] : hAPP(int,int,times_times(int,X755),X756) = hAPP(int,int,times_times(int,X756),X755),
inference(variable_rename,[status(thm)],[fact_23_zmult__commute]) ).
fof(c_0_17,plain,
! [X772,X773] : hAPP(int,int,plus_plus(int,X772),X773) = hAPP(int,int,plus_plus(int,X773),X772),
inference(variable_rename,[status(thm)],[fact_98_zadd__commute]) ).
fof(c_0_18,hypothesis,
! [X1000] : ti(int,bit1(X1000)) = bit1(X1000),
inference(variable_rename,[status(thm)],[tsy_c_Int_OBit1_res]) ).
cnf(c_0_19,plain,
hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int)) = hAPP(int,int,times_times(int,hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int))),t),
inference(split_conjunct,[status(thm)],[fact_3_t]) ).
cnf(c_0_20,hypothesis,
number_number_of(int,bit0(X1)) = bit0(X1),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
hAPP(int,int,times_times(int,X1),X2) = hAPP(int,int,times_times(int,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
hAPP(int,int,plus_plus(int,X1),X2) = hAPP(int,int,plus_plus(int,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_23,negated_conjecture,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int))),zero_zero(int))),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
cnf(c_0_24,hypothesis,
ti(int,bit1(X1)) = bit1(X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
twoSqu1929807760sum2sq(product_Pair(int,int,s,one_one(int))) = hAPP(int,int,times_times(int,hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int))),t),
inference(split_conjunct,[status(thm)],[fact_751__096sum2sq_A_Is_M_A1_J_A_061_A_I4_A_K_Am_A_L_A1_J_A_K_At_096]) ).
cnf(c_0_26,plain,
hAPP(int,int,times_times(int,t),hAPP(int,int,plus_plus(int,one_one(int)),hAPP(int,int,times_times(int,m),bit0(bit0(bit1(pls)))))) = hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22]),c_0_21]),c_0_22]) ).
fof(c_0_27,plain,
! [X1007] : hAPP(int,int,times_times(int,pls),X1007) = pls,
inference(variable_rename,[status(thm)],[fact_62_mult__Pls]) ).
cnf(c_0_28,negated_conjecture,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int))),zero_zero(int))),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
pls = zero_zero(int),
inference(split_conjunct,[status(thm)],[fact_122_Pls__def]) ).
cnf(c_0_30,plain,
one_one(int) = number_number_of(int,bit1(pls)),
inference(split_conjunct,[status(thm)],[fact_111_one__is__num__one]) ).
cnf(c_0_31,hypothesis,
number_number_of(int,bit1(X1)) = bit1(X1),
inference(rw,[status(thm)],[c_0_24,c_0_15]) ).
cnf(c_0_32,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,times_times(int,hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int))),t)),hAPP(int,int,times_times(int,hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int))),zero_zero(int)))),
inference(split_conjunct,[status(thm)],[fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096]) ).
cnf(c_0_33,plain,
hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))) = twoSqu1929807760sum2sq(product_Pair(int,int,s,one_one(int))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_20]),c_0_21]),c_0_22]),c_0_21]),c_0_26]) ).
cnf(c_0_34,plain,
hAPP(int,int,times_times(int,pls),X1) = pls,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,negated_conjecture,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int))),pls)),
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,plain,
one_one(int) = bit1(pls),
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),twoSqu1929807760sum2sq(product_Pair(int,int,s,one_one(int)))),pls)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_20]),c_0_21]),c_0_22]),c_0_21]),c_0_26]),c_0_33]),c_0_20]),c_0_21]),c_0_22]),c_0_29]),c_0_21]),c_0_34]) ).
cnf(c_0_38,negated_conjecture,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),twoSqu1929807760sum2sq(product_Pair(int,int,s,bit1(pls)))),pls)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_22]),c_0_33]),c_0_36]) ).
cnf(c_0_39,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_36]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.21 % Problem : NUM924+7 : TPTP v8.1.2. Released v5.3.0.
% 0.08/0.22 % Command : run_E %s %d THM
% 0.21/0.41 % Computer : n024.cluster.edu
% 0.21/0.41 % Model : x86_64 x86_64
% 0.21/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.41 % Memory : 8042.1875MB
% 0.21/0.41 % OS : Linux 3.10.0-693.el7.x86_64
% 0.21/0.41 % CPULimit : 2400
% 0.21/0.41 % WCLimit : 300
% 0.21/0.41 % DateTime : Mon Oct 2 13:33:12 EDT 2023
% 0.21/0.41 % CPUTime :
% 0.26/0.66 Running first-order theorem proving
% 0.26/0.66 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.fkZBm4c3tU/E---3.1_27757.p
% 0.48/1.02 # Version: 3.1pre001
% 0.48/1.02 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.48/1.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/1.02 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.48/1.02 # Starting new_bool_3 with 300s (1) cores
% 0.48/1.02 # Starting new_bool_1 with 300s (1) cores
% 0.48/1.02 # Starting sh5l with 300s (1) cores
% 0.48/1.02 # sh5l with pid 27844 completed with status 0
% 0.48/1.02 # Result found by sh5l
% 0.48/1.02 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.48/1.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/1.02 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.48/1.02 # Starting new_bool_3 with 300s (1) cores
% 0.48/1.02 # Starting new_bool_1 with 300s (1) cores
% 0.48/1.02 # Starting sh5l with 300s (1) cores
% 0.48/1.02 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.48/1.02 # Search class: FGHSM-SSLM32-DFFFFFNN
% 0.48/1.02 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.48/1.02 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 23s (1) cores
% 0.48/1.02 # G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with pid 27847 completed with status 0
% 0.48/1.02 # Result found by G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 0.48/1.02 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.48/1.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/1.02 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.48/1.02 # Starting new_bool_3 with 300s (1) cores
% 0.48/1.02 # Starting new_bool_1 with 300s (1) cores
% 0.48/1.02 # Starting sh5l with 300s (1) cores
% 0.48/1.02 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.48/1.02 # Search class: FGHSM-SSLM32-DFFFFFNN
% 0.48/1.02 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.48/1.02 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 23s (1) cores
% 0.48/1.02 # Preprocessing time : 0.025 s
% 0.48/1.02 # Presaturation interreduction done
% 0.48/1.02
% 0.48/1.02 # Proof found!
% 0.48/1.02 # SZS status Theorem
% 0.48/1.02 # SZS output start CNFRefutation
% See solution above
% 0.48/1.02 # Parsed axioms : 1255
% 0.48/1.02 # Removed by relevancy pruning/SinE : 370
% 0.48/1.02 # Initial clauses : 1280
% 0.48/1.02 # Removed in clause preprocessing : 74
% 0.48/1.02 # Initial clauses in saturation : 1206
% 0.48/1.02 # Processed clauses : 1498
% 0.48/1.02 # ...of these trivial : 17
% 0.48/1.02 # ...subsumed : 160
% 0.48/1.02 # ...remaining for further processing : 1320
% 0.48/1.02 # Other redundant clauses eliminated : 79
% 0.48/1.02 # Clauses deleted for lack of memory : 0
% 0.48/1.02 # Backward-subsumed : 2
% 0.48/1.02 # Backward-rewritten : 56
% 0.48/1.02 # Generated clauses : 643
% 0.48/1.02 # ...of the previous two non-redundant : 455
% 0.48/1.02 # ...aggressively subsumed : 0
% 0.48/1.02 # Contextual simplify-reflections : 2
% 0.48/1.02 # Paramodulations : 561
% 0.48/1.02 # Factorizations : 0
% 0.48/1.02 # NegExts : 0
% 0.48/1.02 # Equation resolutions : 88
% 0.48/1.02 # Total rewrite steps : 1450
% 0.48/1.02 # Propositional unsat checks : 0
% 0.48/1.02 # Propositional check models : 0
% 0.48/1.02 # Propositional check unsatisfiable : 0
% 0.48/1.02 # Propositional clauses : 0
% 0.48/1.02 # Propositional clauses after purity: 0
% 0.48/1.02 # Propositional unsat core size : 0
% 0.48/1.02 # Propositional preprocessing time : 0.000
% 0.48/1.02 # Propositional encoding time : 0.000
% 0.48/1.02 # Propositional solver time : 0.000
% 0.48/1.02 # Success case prop preproc time : 0.000
% 0.48/1.02 # Success case prop encoding time : 0.000
% 0.48/1.02 # Success case prop solver time : 0.000
% 0.48/1.02 # Current number of processed clauses : 211
% 0.48/1.02 # Positive orientable unit clauses : 119
% 0.48/1.02 # Positive unorientable unit clauses: 0
% 0.48/1.02 # Negative unit clauses : 17
% 0.48/1.02 # Non-unit-clauses : 75
% 0.48/1.02 # Current number of unprocessed clauses: 1155
% 0.48/1.02 # ...number of literals in the above : 2784
% 0.48/1.02 # Current number of archived formulas : 0
% 0.48/1.02 # Current number of archived clauses : 1050
% 0.48/1.02 # Clause-clause subsumption calls (NU) : 60314
% 0.48/1.02 # Rec. Clause-clause subsumption calls : 31872
% 0.48/1.02 # Non-unit clause-clause subsumptions : 145
% 0.48/1.02 # Unit Clause-clause subsumption calls : 1459
% 0.48/1.02 # Rewrite failures with RHS unbound : 0
% 0.48/1.02 # BW rewrite match attempts : 10199
% 0.48/1.02 # BW rewrite match successes : 110
% 0.48/1.02 # Condensation attempts : 0
% 0.48/1.02 # Condensation successes : 0
% 0.48/1.02 # Termbank termtop insertions : 229772
% 0.48/1.02
% 0.48/1.02 # -------------------------------------------------
% 0.48/1.02 # User time : 0.281 s
% 0.48/1.02 # System time : 0.019 s
% 0.48/1.02 # Total time : 0.300 s
% 0.48/1.02 # Maximum resident set size: 7692 pages
% 0.48/1.02
% 0.48/1.02 # -------------------------------------------------
% 0.48/1.02 # User time : 0.317 s
% 0.48/1.02 # System time : 0.022 s
% 0.48/1.02 # Total time : 0.339 s
% 0.48/1.02 # Maximum resident set size: 3376 pages
% 0.48/1.02 % E---3.1 exiting
% 0.48/1.02 % E---3.1 exiting
%------------------------------------------------------------------------------