TSTP Solution File: SWV617-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWV617-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 : Tue May 21 05:41:55 EDT 2024
% Result : Unsatisfiable 0.91s 0.64s
% Output : CNFRefutation 0.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 25 ( 16 unt; 0 nHn; 11 RR)
% Number of literals : 34 ( 18 equ; 13 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 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 : 23 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
c_HOL_Oinverse__class_Odivide(c_HOL_Ominus__class_Ominus(c_Power_Opower__class_Opower(c_Power_Opower__class_Opower(c_FFT__Mirabelle_Oroot(v_n),v_n,tc_Complex_Ocomplex),v_k,tc_Complex_Ocomplex),c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_HOL_Ominus__class_Ominus(c_Power_Opower__class_Opower(c_FFT__Mirabelle_Oroot(v_n),v_k,tc_Complex_Ocomplex),c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex) != c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_power__one_0,axiom,
( c_Power_Opower__class_Opower(c_HOL_Oone__class_Oone(X1),X2,X1) = c_HOL_Oone__class_Oone(X1)
| ~ class_OrderedGroup_Omonoid__mult(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_power__one_0) ).
cnf(cls_right__minus__eq_1,axiom,
( c_HOL_Ominus__class_Ominus(X2,X2,X1) = c_HOL_Ozero__class_Ozero(X1)
| ~ class_OrderedGroup_Ogroup__add(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_right__minus__eq_1) ).
cnf(cls_divide_Ozero_0,axiom,
( c_HOL_Oinverse__class_Odivide(c_HOL_Ozero__class_Ozero(X1),X2,X1) = c_HOL_Ozero__class_Ozero(X1)
| ~ class_RealVector_Oreal__normed__field(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_divide_Ozero_0) ).
cnf(cls_root__unity_0,axiom,
c_Power_Opower__class_Opower(c_FFT__Mirabelle_Oroot(X1),X1,tc_Complex_Ocomplex) = c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_root__unity_0) ).
cnf(clsarity_Complex__Ocomplex__OrderedGroup_Omonoid__mult,axiom,
class_OrderedGroup_Omonoid__mult(tc_Complex_Ocomplex),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsarity_Complex__Ocomplex__OrderedGroup_Omonoid__mult) ).
cnf(clsarity_Complex__Ocomplex__OrderedGroup_Ogroup__add,axiom,
class_OrderedGroup_Ogroup__add(tc_Complex_Ocomplex),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsarity_Complex__Ocomplex__OrderedGroup_Ogroup__add) ).
cnf(clsarity_Complex__Ocomplex__RealVector_Oreal__normed__field,axiom,
class_RealVector_Oreal__normed__field(tc_Complex_Ocomplex),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsarity_Complex__Ocomplex__RealVector_Oreal__normed__field) ).
cnf(c_0_8,negated_conjecture,
c_HOL_Oinverse__class_Odivide(c_HOL_Ominus__class_Ominus(c_Power_Opower__class_Opower(c_Power_Opower__class_Opower(c_FFT__Mirabelle_Oroot(v_n),v_n,tc_Complex_Ocomplex),v_k,tc_Complex_Ocomplex),c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_HOL_Ominus__class_Ominus(c_Power_Opower__class_Opower(c_FFT__Mirabelle_Oroot(v_n),v_k,tc_Complex_Ocomplex),c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex) != c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_9,plain,
( c_Power_Opower__class_Opower(c_HOL_Oone__class_Oone(X1),X2,X1) = c_HOL_Oone__class_Oone(X1)
| ~ class_OrderedGroup_Omonoid__mult(X1) ),
inference(fof_simplification,[status(thm)],[cls_power__one_0]) ).
cnf(c_0_10,plain,
( c_HOL_Ominus__class_Ominus(X2,X2,X1) = c_HOL_Ozero__class_Ozero(X1)
| ~ class_OrderedGroup_Ogroup__add(X1) ),
inference(fof_simplification,[status(thm)],[cls_right__minus__eq_1]) ).
cnf(c_0_11,plain,
( c_HOL_Oinverse__class_Odivide(c_HOL_Ozero__class_Ozero(X1),X2,X1) = c_HOL_Ozero__class_Ozero(X1)
| ~ class_RealVector_Oreal__normed__field(X1) ),
inference(fof_simplification,[status(thm)],[cls_divide_Ozero_0]) ).
cnf(c_0_12,negated_conjecture,
c_HOL_Oinverse__class_Odivide(c_HOL_Ominus__class_Ominus(c_Power_Opower__class_Opower(c_Power_Opower__class_Opower(c_FFT__Mirabelle_Oroot(v_n),v_n,tc_Complex_Ocomplex),v_k,tc_Complex_Ocomplex),c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_HOL_Ominus__class_Ominus(c_Power_Opower__class_Opower(c_FFT__Mirabelle_Oroot(v_n),v_k,tc_Complex_Ocomplex),c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex) != c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),
c_0_8 ).
cnf(c_0_13,axiom,
c_Power_Opower__class_Opower(c_FFT__Mirabelle_Oroot(X1),X1,tc_Complex_Ocomplex) = c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),
cls_root__unity_0 ).
cnf(c_0_14,plain,
( c_Power_Opower__class_Opower(c_HOL_Oone__class_Oone(X1),X2,X1) = c_HOL_Oone__class_Oone(X1)
| ~ class_OrderedGroup_Omonoid__mult(X1) ),
c_0_9 ).
cnf(c_0_15,axiom,
class_OrderedGroup_Omonoid__mult(tc_Complex_Ocomplex),
clsarity_Complex__Ocomplex__OrderedGroup_Omonoid__mult ).
cnf(c_0_16,plain,
( c_HOL_Ominus__class_Ominus(X2,X2,X1) = c_HOL_Ozero__class_Ozero(X1)
| ~ class_OrderedGroup_Ogroup__add(X1) ),
c_0_10 ).
cnf(c_0_17,axiom,
class_OrderedGroup_Ogroup__add(tc_Complex_Ocomplex),
clsarity_Complex__Ocomplex__OrderedGroup_Ogroup__add ).
cnf(c_0_18,plain,
( c_HOL_Oinverse__class_Odivide(c_HOL_Ozero__class_Ozero(X1),X2,X1) = c_HOL_Ozero__class_Ozero(X1)
| ~ class_RealVector_Oreal__normed__field(X1) ),
c_0_11 ).
cnf(c_0_19,axiom,
class_RealVector_Oreal__normed__field(tc_Complex_Ocomplex),
clsarity_Complex__Ocomplex__RealVector_Oreal__normed__field ).
cnf(c_0_20,negated_conjecture,
c_HOL_Oinverse__class_Odivide(c_HOL_Ominus__class_Ominus(c_Power_Opower__class_Opower(c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),v_k,tc_Complex_Ocomplex),c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_HOL_Ominus__class_Ominus(c_Power_Opower__class_Opower(c_FFT__Mirabelle_Oroot(v_n),v_k,tc_Complex_Ocomplex),c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex) != c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_21,plain,
c_Power_Opower__class_Opower(c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),X1,tc_Complex_Ocomplex) = c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,plain,
c_HOL_Ominus__class_Ominus(X1,X1,tc_Complex_Ocomplex) = c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
c_HOL_Oinverse__class_Odivide(c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),X1,tc_Complex_Ocomplex) = c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[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.11/0.12 % Problem : SWV617-1 : TPTP v8.2.0. Released v4.1.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n008.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 09:26:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.52 Running first-order model finding
% 0.21/0.52 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.91/0.64 # Version: 3.1.0
% 0.91/0.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.91/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.91/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.91/0.64 # Starting new_bool_3 with 300s (1) cores
% 0.91/0.64 # Starting new_bool_1 with 300s (1) cores
% 0.91/0.64 # Starting sh5l with 300s (1) cores
% 0.91/0.64 # sh5l with pid 4725 completed with status 0
% 0.91/0.64 # Result found by sh5l
% 0.91/0.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.91/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.91/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.91/0.64 # Starting new_bool_3 with 300s (1) cores
% 0.91/0.64 # Starting new_bool_1 with 300s (1) cores
% 0.91/0.64 # Starting sh5l with 300s (1) cores
% 0.91/0.64 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.91/0.64 # Search class: FGHSF-FSLM32-MFFFFFNN
% 0.91/0.64 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.91/0.64 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 163s (1) cores
% 0.91/0.64 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 4732 completed with status 0
% 0.91/0.64 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.91/0.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.91/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.91/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.91/0.64 # Starting new_bool_3 with 300s (1) cores
% 0.91/0.64 # Starting new_bool_1 with 300s (1) cores
% 0.91/0.64 # Starting sh5l with 300s (1) cores
% 0.91/0.64 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.91/0.64 # Search class: FGHSF-FSLM32-MFFFFFNN
% 0.91/0.64 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.91/0.64 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 163s (1) cores
% 0.91/0.64 # Preprocessing time : 0.010 s
% 0.91/0.64 # Presaturation interreduction done
% 0.91/0.64
% 0.91/0.64 # Proof found!
% 0.91/0.64 # SZS status Unsatisfiable
% 0.91/0.64 # SZS output start CNFRefutation
% See solution above
% 0.91/0.64 # Parsed axioms : 766
% 0.91/0.64 # Removed by relevancy pruning/SinE : 86
% 0.91/0.64 # Initial clauses : 680
% 0.91/0.64 # Removed in clause preprocessing : 0
% 0.91/0.64 # Initial clauses in saturation : 680
% 0.91/0.64 # Processed clauses : 832
% 0.91/0.64 # ...of these trivial : 2
% 0.91/0.64 # ...subsumed : 192
% 0.91/0.64 # ...remaining for further processing : 638
% 0.91/0.64 # Other redundant clauses eliminated : 0
% 0.91/0.64 # Clauses deleted for lack of memory : 0
% 0.91/0.64 # Backward-subsumed : 0
% 0.91/0.64 # Backward-rewritten : 0
% 0.91/0.64 # Generated clauses : 78
% 0.91/0.64 # ...of the previous two non-redundant : 59
% 0.91/0.64 # ...aggressively subsumed : 0
% 0.91/0.64 # Contextual simplify-reflections : 0
% 0.91/0.64 # Paramodulations : 77
% 0.91/0.64 # Factorizations : 0
% 0.91/0.64 # NegExts : 0
% 0.91/0.64 # Equation resolutions : 1
% 0.91/0.64 # Disequality decompositions : 0
% 0.91/0.64 # Total rewrite steps : 35
% 0.91/0.64 # ...of those cached : 11
% 0.91/0.64 # Propositional unsat checks : 0
% 0.91/0.64 # Propositional check models : 0
% 0.91/0.64 # Propositional check unsatisfiable : 0
% 0.91/0.64 # Propositional clauses : 0
% 0.91/0.64 # Propositional clauses after purity: 0
% 0.91/0.64 # Propositional unsat core size : 0
% 0.91/0.64 # Propositional preprocessing time : 0.000
% 0.91/0.64 # Propositional encoding time : 0.000
% 0.91/0.64 # Propositional solver time : 0.000
% 0.91/0.64 # Success case prop preproc time : 0.000
% 0.91/0.64 # Success case prop encoding time : 0.000
% 0.91/0.64 # Success case prop solver time : 0.000
% 0.91/0.64 # Current number of processed clauses : 138
% 0.91/0.64 # Positive orientable unit clauses : 74
% 0.91/0.64 # Positive unorientable unit clauses: 0
% 0.91/0.64 # Negative unit clauses : 10
% 0.91/0.64 # Non-unit-clauses : 54
% 0.91/0.64 # Current number of unprocessed clauses: 406
% 0.91/0.64 # ...number of literals in the above : 1497
% 0.91/0.64 # Current number of archived formulas : 0
% 0.91/0.64 # Current number of archived clauses : 500
% 0.91/0.64 # Clause-clause subsumption calls (NU) : 32021
% 0.91/0.64 # Rec. Clause-clause subsumption calls : 7870
% 0.91/0.64 # Non-unit clause-clause subsumptions : 178
% 0.91/0.64 # Unit Clause-clause subsumption calls : 52
% 0.91/0.64 # Rewrite failures with RHS unbound : 0
% 0.91/0.64 # BW rewrite match attempts : 23
% 0.91/0.64 # BW rewrite match successes : 0
% 0.91/0.64 # Condensation attempts : 0
% 0.91/0.64 # Condensation successes : 0
% 0.91/0.64 # Termbank termtop insertions : 34904
% 0.91/0.64 # Search garbage collected termcells : 2026
% 0.91/0.64
% 0.91/0.64 # -------------------------------------------------
% 0.91/0.64 # User time : 0.077 s
% 0.91/0.64 # System time : 0.011 s
% 0.91/0.64 # Total time : 0.089 s
% 0.91/0.64 # Maximum resident set size: 3364 pages
% 0.91/0.64
% 0.91/0.64 # -------------------------------------------------
% 0.91/0.64 # User time : 0.101 s
% 0.91/0.64 # System time : 0.015 s
% 0.91/0.64 # Total time : 0.116 s
% 0.91/0.64 # Maximum resident set size: 2252 pages
% 0.91/0.64 % E---3.1 exiting
%------------------------------------------------------------------------------