TSTP Solution File: ALG434-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : ALG434-1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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 : Mon May 20 18:13:21 EDT 2024
% Result : Unsatisfiable 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 8 unt; 0 nHn; 8 RR)
% Number of literals : 17 ( 0 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-3 aty)
% Number of variables : 12 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
~ c_Ring__and__Field_Odvd__class_Odvd(v_p,c_Polynomial_Osmult(v_a,v_q,tc_Complex_Ocomplex),tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_dvd__smult_0,axiom,
( c_Ring__and__Field_Odvd__class_Odvd(X2,c_Polynomial_Osmult(X3,X4,X1),tc_Polynomial_Opoly(X1))
| ~ class_Ring__and__Field_Ocomm__semiring__1(X1)
| ~ c_Ring__and__Field_Odvd__class_Odvd(X2,X4,tc_Polynomial_Opoly(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_dvd__smult_0) ).
cnf(clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__1,axiom,
class_Ring__and__Field_Ocomm__semiring__1(tc_Complex_Ocomplex),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__1) ).
cnf(cls_pq_0,axiom,
c_Ring__and__Field_Odvd__class_Odvd(v_p,v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_pq_0) ).
cnf(c_0_4,negated_conjecture,
~ c_Ring__and__Field_Odvd__class_Odvd(v_p,c_Polynomial_Osmult(v_a,v_q,tc_Complex_Ocomplex),tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_5,plain,
( c_Ring__and__Field_Odvd__class_Odvd(X2,c_Polynomial_Osmult(X3,X4,X1),tc_Polynomial_Opoly(X1))
| ~ class_Ring__and__Field_Ocomm__semiring__1(X1)
| ~ c_Ring__and__Field_Odvd__class_Odvd(X2,X4,tc_Polynomial_Opoly(X1)) ),
inference(fof_simplification,[status(thm)],[cls_dvd__smult_0]) ).
cnf(c_0_6,negated_conjecture,
~ c_Ring__and__Field_Odvd__class_Odvd(v_p,c_Polynomial_Osmult(v_a,v_q,tc_Complex_Ocomplex),tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
c_0_4 ).
cnf(c_0_7,plain,
( c_Ring__and__Field_Odvd__class_Odvd(X2,c_Polynomial_Osmult(X3,X4,X1),tc_Polynomial_Opoly(X1))
| ~ class_Ring__and__Field_Ocomm__semiring__1(X1)
| ~ c_Ring__and__Field_Odvd__class_Odvd(X2,X4,tc_Polynomial_Opoly(X1)) ),
c_0_5 ).
cnf(c_0_8,axiom,
class_Ring__and__Field_Ocomm__semiring__1(tc_Complex_Ocomplex),
clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__1 ).
cnf(c_0_9,axiom,
c_Ring__and__Field_Odvd__class_Odvd(v_p,v_q,tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
cls_pq_0 ).
cnf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ALG434-1 : TPTP v8.2.0. Released v4.1.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n008.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 : Sat May 18 22:47:52 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.47 Running first-order model finding
% 0.21/0.47 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.21/0.51 # Version: 3.1.0
% 0.21/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 29278 completed with status 0
% 0.21/0.51 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.21/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FGHSF-FSLM32-MFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 811s (1) cores
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.51 # Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0U with 136s (1) cores
% 0.21/0.51 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.21/0.51 # G-E--_302_C18_F1_URBAN_S0Y with pid 29287 completed with status 0
% 0.21/0.51 # Result found by G-E--_302_C18_F1_URBAN_S0Y
% 0.21/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FGHSF-FSLM32-MFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 811s (1) cores
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.51 # Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.21/0.51 # Preprocessing time : 0.007 s
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Unsatisfiable
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 441
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 441
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 441
% 0.21/0.51 # Processed clauses : 93
% 0.21/0.51 # ...of these trivial : 1
% 0.21/0.51 # ...subsumed : 2
% 0.21/0.51 # ...remaining for further processing : 90
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 0
% 0.21/0.51 # Backward-rewritten : 0
% 0.21/0.51 # Generated clauses : 25
% 0.21/0.51 # ...of the previous two non-redundant : 17
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 25
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 3
% 0.21/0.51 # ...of those cached : 1
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 90
% 0.21/0.51 # Positive orientable unit clauses : 33
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 1
% 0.21/0.51 # Non-unit-clauses : 56
% 0.21/0.51 # Current number of unprocessed clauses: 365
% 0.21/0.51 # ...number of literals in the above : 897
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 0
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 621
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 535
% 0.21/0.51 # Non-unit clause-clause subsumptions : 2
% 0.21/0.51 # Unit Clause-clause subsumption calls : 26
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 0
% 0.21/0.51 # BW rewrite match successes : 0
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 10888
% 0.21/0.51 # Search garbage collected termcells : 751
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.014 s
% 0.21/0.51 # System time : 0.006 s
% 0.21/0.51 # Total time : 0.020 s
% 0.21/0.51 # Maximum resident set size: 2580 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.067 s
% 0.21/0.51 # System time : 0.018 s
% 0.21/0.51 # Total time : 0.085 s
% 0.21/0.51 # Maximum resident set size: 2004 pages
% 0.21/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------