TSTP Solution File: SWV632-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWV632-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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 19:55:02 EDT 2023
% Result : Unsatisfiable 803.08s 103.21s
% Output : CNFRefutation 803.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 27 ( 23 unt; 2 nHn; 14 RR)
% Number of literals : 31 ( 21 equ; 8 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 6 con; 0-3 aty)
% Number of variables : 32 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_numeral__1__eq__Suc__0_0,axiom,
c_Int_Onumber__class_Onumber__of(c_Int_OBit1(c_Int_OPls),tc_nat) = c_Suc(c_HOL_Ozero__class_Ozero(tc_nat)),
file('/export/starexec/sandbox/tmp/tmp.naIQMw5uSq/E---3.1_11360.p',cls_numeral__1__eq__Suc__0_0) ).
cnf(cls_Numeral1__eq1__nat_0,axiom,
c_HOL_Oone__class_Oone(tc_nat) = c_Int_Onumber__class_Onumber__of(c_Int_OBit1(c_Int_OPls),tc_nat),
file('/export/starexec/sandbox/tmp/tmp.naIQMw5uSq/E---3.1_11360.p',cls_Numeral1__eq1__nat_0) ).
cnf(cls_Suc__eq__plus1_0,axiom,
c_Suc(X1) = c_HOL_Oplus__class_Oplus(X1,c_HOL_Oone__class_Oone(tc_nat),tc_nat),
file('/export/starexec/sandbox/tmp/tmp.naIQMw5uSq/E---3.1_11360.p',cls_Suc__eq__plus1_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_Power_Opower__class_Opower(c_FFT__Mirabelle_Oroot(c_HOL_Otimes__class_Otimes(c_Int_Onumber__class_Onumber__of(c_Int_OBit0(c_Int_OBit1(c_Int_OPls)),tc_nat),v_m,tc_nat)),c_HOL_Otimes__class_Otimes(v_i,c_HOL_Otimes__class_Otimes(c_Int_Onumber__class_Onumber__of(c_Int_OBit0(c_Int_OBit1(c_Int_OPls)),tc_nat),v_j,tc_nat),tc_nat),tc_Complex_Ocomplex) != c_Power_Opower__class_Opower(c_FFT__Mirabelle_Oroot(v_m),c_HOL_Otimes__class_Otimes(v_i,v_j,tc_nat),tc_Complex_Ocomplex),
file('/export/starexec/sandbox/tmp/tmp.naIQMw5uSq/E---3.1_11360.p',cls_conjecture_0) ).
cnf(cls_comp__arith_I115_J_0,axiom,
c_Suc(c_Suc(c_HOL_Ozero__class_Ozero(tc_nat))) = c_Int_Onumber__class_Onumber__of(c_Int_OBit0(c_Int_OBit1(c_Int_OPls)),tc_nat),
file('/export/starexec/sandbox/tmp/tmp.naIQMw5uSq/E---3.1_11360.p',cls_comp__arith_I115_J_0) ).
cnf(cls_nat__mult__assoc_0,axiom,
c_HOL_Otimes__class_Otimes(c_HOL_Otimes__class_Otimes(X1,X2,tc_nat),X3,tc_nat) = c_HOL_Otimes__class_Otimes(X1,c_HOL_Otimes__class_Otimes(X2,X3,tc_nat),tc_nat),
file('/export/starexec/sandbox/tmp/tmp.naIQMw5uSq/E---3.1_11360.p',cls_nat__mult__assoc_0) ).
cnf(cls_nat__mult__commute_0,axiom,
c_HOL_Otimes__class_Otimes(X1,X2,tc_nat) = c_HOL_Otimes__class_Otimes(X2,X1,tc_nat),
file('/export/starexec/sandbox/tmp/tmp.naIQMw5uSq/E---3.1_11360.p',cls_nat__mult__commute_0) ).
cnf(cls_not__add__less2_0,axiom,
~ c_HOL_Oord__class_Oless(c_HOL_Oplus__class_Oplus(X1,X2,tc_nat),X2,tc_nat),
file('/export/starexec/sandbox/tmp/tmp.naIQMw5uSq/E---3.1_11360.p',cls_not__add__less2_0) ).
cnf(cls_not__less__eq_0,axiom,
( c_HOL_Oord__class_Oless(X1,c_Suc(X2),tc_nat)
| c_HOL_Oord__class_Oless(X2,X1,tc_nat) ),
file('/export/starexec/sandbox/tmp/tmp.naIQMw5uSq/E---3.1_11360.p',cls_not__less__eq_0) ).
cnf(cls_root__cancel_0,axiom,
( c_Power_Opower__class_Opower(c_FFT__Mirabelle_Oroot(c_HOL_Otimes__class_Otimes(X1,X2,tc_nat)),c_HOL_Otimes__class_Otimes(X1,X3,tc_nat),tc_Complex_Ocomplex) = c_Power_Opower__class_Opower(c_FFT__Mirabelle_Oroot(X2),X3,tc_Complex_Ocomplex)
| ~ c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_nat),X1,tc_nat) ),
file('/export/starexec/sandbox/tmp/tmp.naIQMw5uSq/E---3.1_11360.p',cls_root__cancel_0) ).
cnf(c_0_10,axiom,
c_Int_Onumber__class_Onumber__of(c_Int_OBit1(c_Int_OPls),tc_nat) = c_Suc(c_HOL_Ozero__class_Ozero(tc_nat)),
cls_numeral__1__eq__Suc__0_0 ).
cnf(c_0_11,axiom,
c_HOL_Oone__class_Oone(tc_nat) = c_Int_Onumber__class_Onumber__of(c_Int_OBit1(c_Int_OPls),tc_nat),
cls_Numeral1__eq1__nat_0 ).
cnf(c_0_12,axiom,
c_Suc(X1) = c_HOL_Oplus__class_Oplus(X1,c_HOL_Oone__class_Oone(tc_nat),tc_nat),
cls_Suc__eq__plus1_0 ).
cnf(c_0_13,plain,
c_HOL_Oone__class_Oone(tc_nat) = c_Suc(c_HOL_Ozero__class_Ozero(tc_nat)),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
c_Power_Opower__class_Opower(c_FFT__Mirabelle_Oroot(c_HOL_Otimes__class_Otimes(c_Int_Onumber__class_Onumber__of(c_Int_OBit0(c_Int_OBit1(c_Int_OPls)),tc_nat),v_m,tc_nat)),c_HOL_Otimes__class_Otimes(v_i,c_HOL_Otimes__class_Otimes(c_Int_Onumber__class_Onumber__of(c_Int_OBit0(c_Int_OBit1(c_Int_OPls)),tc_nat),v_j,tc_nat),tc_nat),tc_Complex_Ocomplex) != c_Power_Opower__class_Opower(c_FFT__Mirabelle_Oroot(v_m),c_HOL_Otimes__class_Otimes(v_i,v_j,tc_nat),tc_Complex_Ocomplex),
cls_conjecture_0 ).
cnf(c_0_15,axiom,
c_Suc(c_Suc(c_HOL_Ozero__class_Ozero(tc_nat))) = c_Int_Onumber__class_Onumber__of(c_Int_OBit0(c_Int_OBit1(c_Int_OPls)),tc_nat),
cls_comp__arith_I115_J_0 ).
cnf(c_0_16,plain,
c_Suc(X1) = c_HOL_Oplus__class_Oplus(X1,c_Suc(c_HOL_Ozero__class_Ozero(tc_nat)),tc_nat),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,axiom,
c_HOL_Otimes__class_Otimes(c_HOL_Otimes__class_Otimes(X1,X2,tc_nat),X3,tc_nat) = c_HOL_Otimes__class_Otimes(X1,c_HOL_Otimes__class_Otimes(X2,X3,tc_nat),tc_nat),
cls_nat__mult__assoc_0 ).
cnf(c_0_18,axiom,
c_HOL_Otimes__class_Otimes(X1,X2,tc_nat) = c_HOL_Otimes__class_Otimes(X2,X1,tc_nat),
cls_nat__mult__commute_0 ).
cnf(c_0_19,negated_conjecture,
c_Power_Opower__class_Opower(c_FFT__Mirabelle_Oroot(c_HOL_Otimes__class_Otimes(c_HOL_Oplus__class_Oplus(c_Suc(c_HOL_Ozero__class_Ozero(tc_nat)),c_Suc(c_HOL_Ozero__class_Ozero(tc_nat)),tc_nat),v_m,tc_nat)),c_HOL_Otimes__class_Otimes(v_i,c_HOL_Otimes__class_Otimes(c_HOL_Oplus__class_Oplus(c_Suc(c_HOL_Ozero__class_Ozero(tc_nat)),c_Suc(c_HOL_Ozero__class_Ozero(tc_nat)),tc_nat),v_j,tc_nat),tc_nat),tc_Complex_Ocomplex) != c_Power_Opower__class_Opower(c_FFT__Mirabelle_Oroot(v_m),c_HOL_Otimes__class_Otimes(v_i,v_j,tc_nat),tc_Complex_Ocomplex),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_15]),c_0_16]) ).
cnf(c_0_20,plain,
c_HOL_Otimes__class_Otimes(X1,c_HOL_Otimes__class_Otimes(X2,X3,tc_nat),tc_nat) = c_HOL_Otimes__class_Otimes(X2,c_HOL_Otimes__class_Otimes(X1,X3,tc_nat),tc_nat),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_17]) ).
cnf(c_0_21,axiom,
~ c_HOL_Oord__class_Oless(c_HOL_Oplus__class_Oplus(X1,X2,tc_nat),X2,tc_nat),
cls_not__add__less2_0 ).
cnf(c_0_22,axiom,
( c_HOL_Oord__class_Oless(X1,c_Suc(X2),tc_nat)
| c_HOL_Oord__class_Oless(X2,X1,tc_nat) ),
cls_not__less__eq_0 ).
cnf(c_0_23,negated_conjecture,
c_Power_Opower__class_Opower(c_FFT__Mirabelle_Oroot(c_HOL_Otimes__class_Otimes(c_HOL_Oplus__class_Oplus(c_Suc(c_HOL_Ozero__class_Ozero(tc_nat)),c_Suc(c_HOL_Ozero__class_Ozero(tc_nat)),tc_nat),v_m,tc_nat)),c_HOL_Otimes__class_Otimes(c_HOL_Oplus__class_Oplus(c_Suc(c_HOL_Ozero__class_Ozero(tc_nat)),c_Suc(c_HOL_Ozero__class_Ozero(tc_nat)),tc_nat),c_HOL_Otimes__class_Otimes(v_i,v_j,tc_nat),tc_nat),tc_Complex_Ocomplex) != c_Power_Opower__class_Opower(c_FFT__Mirabelle_Oroot(v_m),c_HOL_Otimes__class_Otimes(v_i,v_j,tc_nat),tc_Complex_Ocomplex),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,axiom,
( c_Power_Opower__class_Opower(c_FFT__Mirabelle_Oroot(c_HOL_Otimes__class_Otimes(X1,X2,tc_nat)),c_HOL_Otimes__class_Otimes(X1,X3,tc_nat),tc_Complex_Ocomplex) = c_Power_Opower__class_Opower(c_FFT__Mirabelle_Oroot(X2),X3,tc_Complex_Ocomplex)
| ~ c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_nat),X1,tc_nat) ),
cls_root__cancel_0 ).
cnf(c_0_25,plain,
c_HOL_Oord__class_Oless(X1,c_HOL_Oplus__class_Oplus(X2,c_Suc(X1),tc_nat),tc_nat),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.25 % Problem : SWV632-1 : TPTP v8.1.2. Released v4.1.0.
% 0.10/0.26 % Command : run_E %s %d THM
% 0.24/0.46 % Computer : n004.cluster.edu
% 0.24/0.46 % Model : x86_64 x86_64
% 0.24/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.24/0.46 % Memory : 8042.1875MB
% 0.24/0.46 % OS : Linux 3.10.0-693.el7.x86_64
% 0.24/0.46 % CPULimit : 2400
% 0.24/0.46 % WCLimit : 300
% 0.24/0.46 % DateTime : Tue Oct 3 03:41:15 EDT 2023
% 0.24/0.46 % CPUTime :
% 0.39/0.71 Running first-order theorem proving
% 0.39/0.71 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.naIQMw5uSq/E---3.1_11360.p
% 803.08/103.21 # Version: 3.1pre001
% 803.08/103.21 # Preprocessing class: FMLMSMSMSSSNFFN.
% 803.08/103.21 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 803.08/103.21 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 803.08/103.21 # Starting new_bool_3 with 300s (1) cores
% 803.08/103.21 # Starting new_bool_1 with 300s (1) cores
% 803.08/103.21 # Starting sh5l with 300s (1) cores
% 803.08/103.21 # new_bool_3 with pid 11443 completed with status 0
% 803.08/103.21 # Result found by new_bool_3
% 803.08/103.21 # Preprocessing class: FMLMSMSMSSSNFFN.
% 803.08/103.21 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 803.08/103.21 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 803.08/103.21 # Starting new_bool_3 with 300s (1) cores
% 803.08/103.21 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 803.08/103.21 # Search class: FGHSM-FSLM32-DFFFFFNN
% 803.08/103.21 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 803.08/103.21 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 803.08/103.21 # G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 11446 completed with status 7
% 803.08/103.21 # Starting new_bool_3 with 31s (1) cores
% 803.08/103.21 # new_bool_3 with pid 11457 completed with status 7
% 803.08/103.21 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 23s (1) cores
% 803.08/103.21 # G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with pid 11465 completed with status 7
% 803.08/103.21 # Starting U----_206c_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 23s (1) cores
% 803.08/103.21 # U----_206c_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 11472 completed with status 7
% 803.08/103.21 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with 23s (1) cores
% 803.08/103.21 # G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with pid 11478 completed with status 0
% 803.08/103.21 # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y
% 803.08/103.21 # Preprocessing class: FMLMSMSMSSSNFFN.
% 803.08/103.21 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 803.08/103.21 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 803.08/103.21 # Starting new_bool_3 with 300s (1) cores
% 803.08/103.21 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 803.08/103.21 # Search class: FGHSM-FSLM32-DFFFFFNN
% 803.08/103.21 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 803.08/103.21 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 803.08/103.21 # G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 11446 completed with status 7
% 803.08/103.21 # Starting new_bool_3 with 31s (1) cores
% 803.08/103.21 # new_bool_3 with pid 11457 completed with status 7
% 803.08/103.21 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 23s (1) cores
% 803.08/103.21 # G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with pid 11465 completed with status 7
% 803.08/103.21 # Starting U----_206c_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 23s (1) cores
% 803.08/103.21 # U----_206c_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 11472 completed with status 7
% 803.08/103.21 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with 23s (1) cores
% 803.08/103.21 # Preprocessing time : 0.011 s
% 803.08/103.21 # Presaturation interreduction done
% 803.08/103.21
% 803.08/103.21 # Proof found!
% 803.08/103.21 # SZS status Unsatisfiable
% 803.08/103.21 # SZS output start CNFRefutation
% See solution above
% 803.08/103.21 # Parsed axioms : 1484
% 803.08/103.21 # Removed by relevancy pruning/SinE : 657
% 803.08/103.21 # Initial clauses : 827
% 803.08/103.21 # Removed in clause preprocessing : 0
% 803.08/103.21 # Initial clauses in saturation : 827
% 803.08/103.21 # Processed clauses : 6144
% 803.08/103.21 # ...of these trivial : 91
% 803.08/103.21 # ...subsumed : 4267
% 803.08/103.21 # ...remaining for further processing : 1786
% 803.08/103.21 # Other redundant clauses eliminated : 19
% 803.08/103.21 # Clauses deleted for lack of memory : 0
% 803.08/103.21 # Backward-subsumed : 78
% 803.08/103.21 # Backward-rewritten : 30
% 803.08/103.21 # Generated clauses : 21485
% 803.08/103.21 # ...of the previous two non-redundant : 19112
% 803.08/103.21 # ...aggressively subsumed : 0
% 803.08/103.21 # Contextual simplify-reflections : 2
% 803.08/103.21 # Paramodulations : 21425
% 803.08/103.21 # Factorizations : 5
% 803.08/103.21 # NegExts : 0
% 803.08/103.21 # Equation resolutions : 55
% 803.08/103.21 # Total rewrite steps : 10170
% 803.08/103.21 # Propositional unsat checks : 0
% 803.08/103.21 # Propositional check models : 0
% 803.08/103.21 # Propositional check unsatisfiable : 0
% 803.08/103.21 # Propositional clauses : 0
% 803.08/103.21 # Propositional clauses after purity: 0
% 803.08/103.21 # Propositional unsat core size : 0
% 803.08/103.21 # Propositional preprocessing time : 0.000
% 803.08/103.21 # Propositional encoding time : 0.000
% 803.08/103.21 # Propositional solver time : 0.000
% 803.08/103.21 # Success case prop preproc time : 0.000
% 803.08/103.21 # Success case prop encoding time : 0.000
% 803.08/103.21 # Success case prop solver time : 0.000
% 803.08/103.21 # Current number of processed clauses : 1118
% 803.08/103.21 # Positive orientable unit clauses : 171
% 803.08/103.21 # Positive unorientable unit clauses: 23
% 803.08/103.21 # Negative unit clauses : 201
% 803.08/103.21 # Non-unit-clauses : 723
% 803.08/103.21 # Current number of unprocessed clauses: 14306
% 803.08/103.21 # ...number of literals in the above : 38078
% 803.08/103.21 # Current number of archived formulas : 0
% 803.08/103.21 # Current number of archived clauses : 668
% 803.08/103.21 # Clause-clause subsumption calls (NU) : 99453
% 803.08/103.21 # Rec. Clause-clause subsumption calls : 44621
% 803.08/103.21 # Non-unit clause-clause subsumptions : 1070
% 803.08/103.21 # Unit Clause-clause subsumption calls : 8438
% 803.08/103.21 # Rewrite failures with RHS unbound : 20
% 803.08/103.21 # BW rewrite match attempts : 1599
% 803.08/103.21 # BW rewrite match successes : 367
% 803.08/103.21 # Condensation attempts : 0
% 803.08/103.21 # Condensation successes : 0
% 803.08/103.21 # Termbank termtop insertions : 367424
% 803.08/103.21
% 803.08/103.21 # -------------------------------------------------
% 803.08/103.21 # User time : 98.832 s
% 803.08/103.21 # System time : 1.946 s
% 803.08/103.21 # Total time : 100.778 s
% 803.08/103.21 # Maximum resident set size: 3820 pages
% 803.08/103.21
% 803.08/103.21 # -------------------------------------------------
% 803.08/103.21 # User time : 98.878 s
% 803.08/103.21 # System time : 1.947 s
% 803.08/103.21 # Total time : 100.825 s
% 803.08/103.21 # Maximum resident set size: 2728 pages
% 803.08/103.21 % E---3.1 exiting
% 803.08/103.22 % E---3.1 exiting
%------------------------------------------------------------------------------