TSTP Solution File: ALG417-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : ALG417-1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:18 EDT 2024
% Result : Unsatisfiable 0.12s 0.46s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 10 unt; 0 nHn; 13 RR)
% Number of literals : 16 ( 10 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 3 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_pCons__0__0_0,axiom,
( c_Polynomial_OpCons(c_HOL_Ozero__class_Ozero(X1),c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1)),X1) = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1))
| ~ class_HOL_Ozero(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_pCons__0__0_0) ).
cnf(cls_sne_0,axiom,
v_s____ != c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_sne_0) ).
cnf(cls_conjecture_0,negated_conjecture,
v_k____ = c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_kpn_0,axiom,
v_s____ = c_Polynomial_OpCons(v_k____,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_kpn_0) ).
cnf(clsarity_Complex__Ocomplex__HOL_Ozero,axiom,
class_HOL_Ozero(tc_Complex_Ocomplex),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsarity_Complex__Ocomplex__HOL_Ozero) ).
cnf(c_0_5,plain,
( c_Polynomial_OpCons(c_HOL_Ozero__class_Ozero(X1),c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1)),X1) = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1))
| ~ class_HOL_Ozero(X1) ),
inference(fof_simplification,[status(thm)],[cls_pCons__0__0_0]) ).
cnf(c_0_6,plain,
v_s____ != c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
inference(fof_simplification,[status(thm)],[cls_sne_0]) ).
cnf(c_0_7,plain,
( c_Polynomial_OpCons(c_HOL_Ozero__class_Ozero(X1),c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1)),X1) = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1))
| ~ class_HOL_Ozero(X1) ),
c_0_5 ).
cnf(c_0_8,negated_conjecture,
v_k____ = c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),
cls_conjecture_0 ).
cnf(c_0_9,axiom,
v_s____ = c_Polynomial_OpCons(v_k____,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),
cls_kpn_0 ).
cnf(c_0_10,axiom,
class_HOL_Ozero(tc_Complex_Ocomplex),
clsarity_Complex__Ocomplex__HOL_Ozero ).
cnf(c_0_11,plain,
v_s____ != c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
c_0_6 ).
cnf(c_0_12,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10])]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.07 % Problem : ALG417-1 : TPTP v8.2.0. Released v4.1.0.
% 0.04/0.08 % Command : run_E %s %d THM
% 0.07/0.27 % Computer : n012.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 300
% 0.07/0.27 % DateTime : Sat May 18 22:58:22 EDT 2024
% 0.07/0.27 % CPUTime :
% 0.12/0.41 Running first-order model finding
% 0.12/0.41 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.12/0.46 # Version: 3.1.0
% 0.12/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.12/0.46 # Starting sh5l with 300s (1) cores
% 0.12/0.46 # new_bool_3 with pid 27588 completed with status 0
% 0.12/0.46 # Result found by new_bool_3
% 0.12/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.46 # Search class: FGUSF-FFLM32-MFFFFFNN
% 0.12/0.46 # partial match(1): FGUSF-FFMM32-MFFFFFNN
% 0.12/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.12/0.46 # SAT001_MinMin_p005000_rr_RG with pid 27591 completed with status 0
% 0.12/0.46 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.12/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.46 # Search class: FGUSF-FFLM32-MFFFFFNN
% 0.12/0.46 # partial match(1): FGUSF-FFMM32-MFFFFFNN
% 0.12/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.12/0.46 # Preprocessing time : 0.003 s
% 0.12/0.46 # Presaturation interreduction done
% 0.12/0.46
% 0.12/0.46 # Proof found!
% 0.12/0.46 # SZS status Unsatisfiable
% 0.12/0.46 # SZS output start CNFRefutation
% See solution above
% 0.12/0.46 # Parsed axioms : 539
% 0.12/0.46 # Removed by relevancy pruning/SinE : 392
% 0.12/0.46 # Initial clauses : 147
% 0.12/0.46 # Removed in clause preprocessing : 0
% 0.12/0.46 # Initial clauses in saturation : 147
% 0.12/0.46 # Processed clauses : 215
% 0.12/0.46 # ...of these trivial : 2
% 0.12/0.46 # ...subsumed : 35
% 0.12/0.46 # ...remaining for further processing : 178
% 0.12/0.46 # Other redundant clauses eliminated : 0
% 0.12/0.46 # Clauses deleted for lack of memory : 0
% 0.12/0.46 # Backward-subsumed : 1
% 0.12/0.46 # Backward-rewritten : 0
% 0.12/0.46 # Generated clauses : 83
% 0.12/0.46 # ...of the previous two non-redundant : 55
% 0.12/0.46 # ...aggressively subsumed : 0
% 0.12/0.46 # Contextual simplify-reflections : 0
% 0.12/0.46 # Paramodulations : 81
% 0.12/0.46 # Factorizations : 0
% 0.12/0.46 # NegExts : 0
% 0.12/0.46 # Equation resolutions : 2
% 0.12/0.46 # Disequality decompositions : 0
% 0.12/0.46 # Total rewrite steps : 66
% 0.12/0.46 # ...of those cached : 54
% 0.12/0.46 # Propositional unsat checks : 0
% 0.12/0.46 # Propositional check models : 0
% 0.12/0.46 # Propositional check unsatisfiable : 0
% 0.12/0.46 # Propositional clauses : 0
% 0.12/0.46 # Propositional clauses after purity: 0
% 0.12/0.46 # Propositional unsat core size : 0
% 0.12/0.46 # Propositional preprocessing time : 0.000
% 0.12/0.46 # Propositional encoding time : 0.000
% 0.12/0.46 # Propositional solver time : 0.000
% 0.12/0.46 # Success case prop preproc time : 0.000
% 0.12/0.46 # Success case prop encoding time : 0.000
% 0.12/0.46 # Success case prop solver time : 0.000
% 0.12/0.46 # Current number of processed clauses : 60
% 0.12/0.46 # Positive orientable unit clauses : 17
% 0.12/0.46 # Positive unorientable unit clauses: 0
% 0.12/0.46 # Negative unit clauses : 1
% 0.12/0.46 # Non-unit-clauses : 42
% 0.12/0.46 # Current number of unprocessed clauses: 100
% 0.12/0.46 # ...number of literals in the above : 267
% 0.12/0.46 # Current number of archived formulas : 0
% 0.12/0.46 # Current number of archived clauses : 118
% 0.12/0.46 # Clause-clause subsumption calls (NU) : 736
% 0.12/0.46 # Rec. Clause-clause subsumption calls : 607
% 0.12/0.46 # Non-unit clause-clause subsumptions : 35
% 0.12/0.46 # Unit Clause-clause subsumption calls : 0
% 0.12/0.46 # Rewrite failures with RHS unbound : 0
% 0.12/0.46 # BW rewrite match attempts : 0
% 0.12/0.46 # BW rewrite match successes : 0
% 0.12/0.46 # Condensation attempts : 0
% 0.12/0.46 # Condensation successes : 0
% 0.12/0.46 # Termbank termtop insertions : 8869
% 0.12/0.46 # Search garbage collected termcells : 1451
% 0.12/0.46
% 0.12/0.46 # -------------------------------------------------
% 0.12/0.46 # User time : 0.015 s
% 0.12/0.46 # System time : 0.007 s
% 0.12/0.46 # Total time : 0.021 s
% 0.12/0.46 # Maximum resident set size: 2312 pages
% 0.12/0.46
% 0.12/0.46 # -------------------------------------------------
% 0.12/0.46 # User time : 0.028 s
% 0.12/0.46 # System time : 0.010 s
% 0.12/0.46 # Total time : 0.038 s
% 0.12/0.46 # Maximum resident set size: 2060 pages
% 0.12/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------