TSTP Solution File: SWW288+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWW288+1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 06:45:12 EDT 2024
% Result : Theorem 1.21s 0.96s
% Output : CNFRefutation 1.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 25 ( 13 unt; 0 def)
% Number of atoms : 43 ( 16 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 33 ( 15 ~; 12 |; 2 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 13 ( 3 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fact__096p_A_061_A_091_058poly_Ap_A_I0_058_058_Ha_J_058_093_096,axiom,
( ( class_Int_Oring__char__0(t_a)
& class_Rings_Oidom(t_a) )
=> v_p = c_Polynomial_OpCons(t_a,hAPP(c_Polynomial_Opoly(t_a,v_p),c_Groups_Ozero__class_Ozero(t_a)),c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact__096p_A_061_A_091_058poly_Ap_A_I0_058_058_Ha_J_058_093_096) ).
fof(fact__096_B_Bx_O_Apoly_Ap_Ax_A_061_Apoly_Ap_A_I0_058_058_Ha_J_096,axiom,
! [X10] :
( ( class_Int_Oring__char__0(t_a)
& class_Rings_Oidom(t_a) )
=> hAPP(c_Polynomial_Opoly(t_a,v_p),X10) = hAPP(c_Polynomial_Opoly(t_a,v_p),c_Groups_Ozero__class_Ozero(t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact__096_B_Bx_O_Apoly_Ap_Ax_A_061_Apoly_Ap_A_I0_058_058_Ha_J_096) ).
fof(tfree_0,hypothesis,
class_Int_Oring__char__0(t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tfree_0) ).
fof(tfree_1,hypothesis,
class_Rings_Oidom(t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tfree_1) ).
fof(clrel_Int_Oring__char__0__Groups_Ozero,axiom,
! [X89] :
( class_Int_Oring__char__0(X89)
=> class_Groups_Ozero(X89) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clrel_Int_Oring__char__0__Groups_Ozero) ).
fof(conj_0,conjecture,
c_Polynomial_Odegree(t_a,v_p) = c_Groups_Ozero__class_Ozero(tc_Nat_Onat),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
fof(fact_degree__pCons__0,axiom,
! [X9,X8] :
( class_Groups_Ozero(X8)
=> c_Polynomial_Odegree(X8,c_Polynomial_OpCons(X8,X9,c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(X8)))) = c_Groups_Ozero__class_Ozero(tc_Nat_Onat) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_degree__pCons__0) ).
fof(c_0_7,plain,
( ~ class_Int_Oring__char__0(t_a)
| ~ class_Rings_Oidom(t_a)
| v_p = c_Polynomial_OpCons(t_a,hAPP(c_Polynomial_Opoly(t_a,v_p),c_Groups_Ozero__class_Ozero(t_a)),c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a))) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[fact__096p_A_061_A_091_058poly_Ap_A_I0_058_058_Ha_J_058_093_096])]) ).
fof(c_0_8,plain,
! [X103] :
( ~ class_Int_Oring__char__0(t_a)
| ~ class_Rings_Oidom(t_a)
| hAPP(c_Polynomial_Opoly(t_a,v_p),X103) = hAPP(c_Polynomial_Opoly(t_a,v_p),c_Groups_Ozero__class_Ozero(t_a)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact__096_B_Bx_O_Apoly_Ap_Ax_A_061_Apoly_Ap_A_I0_058_058_Ha_J_096])])]) ).
cnf(c_0_9,plain,
( v_p = c_Polynomial_OpCons(t_a,hAPP(c_Polynomial_Opoly(t_a,v_p),c_Groups_Ozero__class_Ozero(t_a)),c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)))
| ~ class_Int_Oring__char__0(t_a)
| ~ class_Rings_Oidom(t_a) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,hypothesis,
class_Int_Oring__char__0(t_a),
inference(split_conjunct,[status(thm)],[tfree_0]) ).
cnf(c_0_11,hypothesis,
class_Rings_Oidom(t_a),
inference(split_conjunct,[status(thm)],[tfree_1]) ).
cnf(c_0_12,plain,
( hAPP(c_Polynomial_Opoly(t_a,v_p),X1) = hAPP(c_Polynomial_Opoly(t_a,v_p),c_Groups_Ozero__class_Ozero(t_a))
| ~ class_Int_Oring__char__0(t_a)
| ~ class_Rings_Oidom(t_a) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,plain,
! [X3070] :
( ~ class_Int_Oring__char__0(X3070)
| class_Groups_Ozero(X3070) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[clrel_Int_Oring__char__0__Groups_Ozero])])]) ).
fof(c_0_14,negated_conjecture,
c_Polynomial_Odegree(t_a,v_p) != c_Groups_Ozero__class_Ozero(tc_Nat_Onat),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
fof(c_0_15,plain,
! [X155,X156] :
( ~ class_Groups_Ozero(X156)
| c_Polynomial_Odegree(X156,c_Polynomial_OpCons(X156,X155,c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(X156)))) = c_Groups_Ozero__class_Ozero(tc_Nat_Onat) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_degree__pCons__0])])]) ).
cnf(c_0_16,plain,
c_Polynomial_OpCons(t_a,hAPP(c_Polynomial_Opoly(t_a,v_p),c_Groups_Ozero__class_Ozero(t_a)),c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a))) = v_p,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_17,plain,
hAPP(c_Polynomial_Opoly(t_a,v_p),X1) = hAPP(c_Polynomial_Opoly(t_a,v_p),c_Groups_Ozero__class_Ozero(t_a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_10]),c_0_11])]) ).
cnf(c_0_18,plain,
( class_Groups_Ozero(X1)
| ~ class_Int_Oring__char__0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_19,negated_conjecture,
c_Polynomial_Odegree(t_a,v_p) != c_Groups_Ozero__class_Ozero(tc_Nat_Onat),
inference(fof_nnf,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( c_Polynomial_Odegree(X1,c_Polynomial_OpCons(X1,X2,c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(X1)))) = c_Groups_Ozero__class_Ozero(tc_Nat_Onat)
| ~ class_Groups_Ozero(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
c_Polynomial_OpCons(t_a,hAPP(c_Polynomial_Opoly(t_a,v_p),t_a),c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a))) = v_p,
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,hypothesis,
class_Groups_Ozero(t_a),
inference(spm,[status(thm)],[c_0_18,c_0_10]) ).
cnf(c_0_23,negated_conjecture,
c_Polynomial_Odegree(t_a,v_p) != c_Groups_Ozero__class_Ozero(tc_Nat_Onat),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWW288+1 : TPTP v8.2.0. Released v5.2.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n002.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 : 300
% 0.12/0.34 % DateTime : Sat May 18 19:08:22 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 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
% 1.21/0.96 # Version: 3.1.0
% 1.21/0.96 # Preprocessing class: FMLMSMSMSSSNFFN.
% 1.21/0.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.21/0.96 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.21/0.96 # Starting new_bool_3 with 300s (1) cores
% 1.21/0.96 # Starting new_bool_1 with 300s (1) cores
% 1.21/0.96 # Starting sh5l with 300s (1) cores
% 1.21/0.96 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 9137 completed with status 0
% 1.21/0.96 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.21/0.96 # Preprocessing class: FMLMSMSMSSSNFFN.
% 1.21/0.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.21/0.96 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.21/0.96 # No SInE strategy applied
% 1.21/0.96 # Search class: FGHSM-SMLM32-DFFFFFNN
% 1.21/0.96 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 1.21/0.96 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 113s (1) cores
% 1.21/0.96 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.21/0.96 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 1.21/0.96 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 1.21/0.96 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 113s (1) cores
% 1.21/0.96 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 9145 completed with status 0
% 1.21/0.96 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.21/0.96 # Preprocessing class: FMLMSMSMSSSNFFN.
% 1.21/0.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.21/0.96 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.21/0.96 # No SInE strategy applied
% 1.21/0.96 # Search class: FGHSM-SMLM32-DFFFFFNN
% 1.21/0.96 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 1.21/0.96 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 113s (1) cores
% 1.21/0.96 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.21/0.96 # Preprocessing time : 0.025 s
% 1.21/0.96 # Presaturation interreduction done
% 1.21/0.96
% 1.21/0.96 # Proof found!
% 1.21/0.96 # SZS status Theorem
% 1.21/0.96 # SZS output start CNFRefutation
% See solution above
% 1.21/0.96 # Parsed axioms : 1218
% 1.21/0.96 # Removed by relevancy pruning/SinE : 0
% 1.21/0.96 # Initial clauses : 1684
% 1.21/0.96 # Removed in clause preprocessing : 92
% 1.21/0.96 # Initial clauses in saturation : 1592
% 1.21/0.96 # Processed clauses : 2564
% 1.21/0.96 # ...of these trivial : 21
% 1.21/0.96 # ...subsumed : 439
% 1.21/0.96 # ...remaining for further processing : 2104
% 1.21/0.96 # Other redundant clauses eliminated : 253
% 1.21/0.96 # Clauses deleted for lack of memory : 0
% 1.21/0.96 # Backward-subsumed : 4
% 1.21/0.96 # Backward-rewritten : 9
% 1.21/0.96 # Generated clauses : 3628
% 1.21/0.96 # ...of the previous two non-redundant : 2801
% 1.21/0.96 # ...aggressively subsumed : 0
% 1.21/0.96 # Contextual simplify-reflections : 2
% 1.21/0.96 # Paramodulations : 3400
% 1.21/0.96 # Factorizations : 4
% 1.21/0.96 # NegExts : 0
% 1.21/0.96 # Equation resolutions : 258
% 1.21/0.96 # Disequality decompositions : 0
% 1.21/0.96 # Total rewrite steps : 2254
% 1.21/0.96 # ...of those cached : 1840
% 1.21/0.96 # Propositional unsat checks : 0
% 1.21/0.96 # Propositional check models : 0
% 1.21/0.96 # Propositional check unsatisfiable : 0
% 1.21/0.96 # Propositional clauses : 0
% 1.21/0.96 # Propositional clauses after purity: 0
% 1.21/0.96 # Propositional unsat core size : 0
% 1.21/0.96 # Propositional preprocessing time : 0.000
% 1.21/0.96 # Propositional encoding time : 0.000
% 1.21/0.96 # Propositional solver time : 0.000
% 1.21/0.96 # Success case prop preproc time : 0.000
% 1.21/0.96 # Success case prop encoding time : 0.000
% 1.21/0.96 # Success case prop solver time : 0.000
% 1.21/0.96 # Current number of processed clauses : 656
% 1.21/0.96 # Positive orientable unit clauses : 206
% 1.21/0.96 # Positive unorientable unit clauses: 10
% 1.21/0.96 # Negative unit clauses : 25
% 1.21/0.96 # Non-unit-clauses : 415
% 1.21/0.96 # Current number of unprocessed clauses: 3100
% 1.21/0.96 # ...number of literals in the above : 7120
% 1.21/0.96 # Current number of archived formulas : 0
% 1.21/0.96 # Current number of archived clauses : 1288
% 1.21/0.96 # Clause-clause subsumption calls (NU) : 237916
% 1.21/0.96 # Rec. Clause-clause subsumption calls : 147219
% 1.21/0.96 # Non-unit clause-clause subsumptions : 300
% 1.21/0.96 # Unit Clause-clause subsumption calls : 267
% 1.21/0.96 # Rewrite failures with RHS unbound : 0
% 1.21/0.96 # BW rewrite match attempts : 1018
% 1.21/0.96 # BW rewrite match successes : 187
% 1.21/0.96 # Condensation attempts : 0
% 1.21/0.96 # Condensation successes : 0
% 1.21/0.96 # Termbank termtop insertions : 208007
% 1.21/0.96 # Search garbage collected termcells : 22298
% 1.21/0.96
% 1.21/0.96 # -------------------------------------------------
% 1.21/0.96 # User time : 0.395 s
% 1.21/0.96 # System time : 0.022 s
% 1.21/0.96 # Total time : 0.416 s
% 1.21/0.96 # Maximum resident set size: 8556 pages
% 1.21/0.96
% 1.21/0.96 # -------------------------------------------------
% 1.21/0.96 # User time : 1.590 s
% 1.21/0.96 # System time : 0.078 s
% 1.21/0.96 # Total time : 1.668 s
% 1.21/0.96 # Maximum resident set size: 3116 pages
% 1.21/0.96 % E---3.1 exiting
%------------------------------------------------------------------------------