TSTP Solution File: SWV154+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWV154+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:33:28 EDT 2024
% Result : Theorem 0.11s 0.35s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 7 ( 4 unt; 0 def)
% Number of atoms : 49 ( 18 equ)
% Maximal formula atoms : 15 ( 7 avg)
% Number of connectives : 49 ( 7 ~; 4 |; 28 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 12 con; 0-3 aty)
% Number of variables : 8 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cl5_nebula_norm_0004,conjecture,
( ( pv70 = sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))
& leq(n0,pv10)
& leq(n0,pv12)
& leq(pv10,n135299)
& leq(pv12,n4)
& ! [X14] :
( ( leq(n0,X14)
& leq(X14,pred(pv12)) )
=> a_select3(q,pv10,X14) = divide(sqrt(times(minus(a_select3(center,X14,n0),a_select2(x,pv10)),minus(a_select3(center,X14,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) )
& ! [X18] :
( ( leq(n0,X18)
& leq(X18,pred(pv10)) )
=> sum(n0,n4,a_select3(q,X18,tptp_sum_index)) = n1 ) )
=> ! [X4] :
( ( leq(n0,X4)
& leq(X4,pv12) )
=> ( pv12 = X4
=> divide(sqrt(times(minus(a_select3(center,pv12,n0),a_select2(x,pv10)),minus(a_select3(center,pv12,n0),a_select2(x,pv10)))),pv70) = divide(sqrt(times(minus(a_select3(center,X4,n0),a_select2(x,pv10)),minus(a_select3(center,X4,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_norm_0004) ).
fof(c_0_1,negated_conjecture,
~ ( ( pv70 = sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))
& leq(n0,pv10)
& leq(n0,pv12)
& leq(pv10,n135299)
& leq(pv12,n4)
& ! [X14] :
( ( leq(n0,X14)
& leq(X14,pred(pv12)) )
=> a_select3(q,pv10,X14) = divide(sqrt(times(minus(a_select3(center,X14,n0),a_select2(x,pv10)),minus(a_select3(center,X14,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) )
& ! [X18] :
( ( leq(n0,X18)
& leq(X18,pred(pv10)) )
=> sum(n0,n4,a_select3(q,X18,tptp_sum_index)) = n1 ) )
=> ! [X4] :
( ( leq(n0,X4)
& leq(X4,pv12) )
=> ( pv12 = X4
=> divide(sqrt(times(minus(a_select3(center,pv12,n0),a_select2(x,pv10)),minus(a_select3(center,pv12,n0),a_select2(x,pv10)))),pv70) = divide(sqrt(times(minus(a_select3(center,X4,n0),a_select2(x,pv10)),minus(a_select3(center,X4,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) ) ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_norm_0004]) ).
fof(c_0_2,negated_conjecture,
! [X28,X29] :
( pv70 = sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))
& leq(n0,pv10)
& leq(n0,pv12)
& leq(pv10,n135299)
& leq(pv12,n4)
& ( ~ leq(n0,X28)
| ~ leq(X28,pred(pv12))
| a_select3(q,pv10,X28) = divide(sqrt(times(minus(a_select3(center,X28,n0),a_select2(x,pv10)),minus(a_select3(center,X28,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) )
& ( ~ leq(n0,X29)
| ~ leq(X29,pred(pv10))
| sum(n0,n4,a_select3(q,X29,tptp_sum_index)) = n1 )
& leq(n0,esk1_0)
& leq(esk1_0,pv12)
& pv12 = esk1_0
& divide(sqrt(times(minus(a_select3(center,pv12,n0),a_select2(x,pv10)),minus(a_select3(center,pv12,n0),a_select2(x,pv10)))),pv70) != divide(sqrt(times(minus(a_select3(center,esk1_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk1_0,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).
cnf(c_0_3,negated_conjecture,
divide(sqrt(times(minus(a_select3(center,pv12,n0),a_select2(x,pv10)),minus(a_select3(center,pv12,n0),a_select2(x,pv10)))),pv70) != divide(sqrt(times(minus(a_select3(center,esk1_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk1_0,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
pv12 = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
pv70 = sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4]),c_0_4]),c_0_5])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.07 % Problem : SWV154+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% 0.02/0.08 % Command : run_E %s %d THM
% 0.07/0.26 % Computer : n018.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 300
% 0.11/0.26 % DateTime : Sun May 19 07:59:07 EDT 2024
% 0.11/0.26 % CPUTime :
% 0.11/0.34 Running first-order model finding
% 0.11/0.34 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.11/0.35 # Version: 3.1.0
% 0.11/0.35 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.11/0.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.35 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.11/0.35 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.35 # Starting new_bool_1 with 300s (1) cores
% 0.11/0.35 # Starting sh5l with 300s (1) cores
% 0.11/0.35 # new_bool_3 with pid 14235 completed with status 0
% 0.11/0.35 # Result found by new_bool_3
% 0.11/0.35 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.11/0.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.35 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.11/0.35 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.35 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.35 # Search class: FGUSM-FFMM31-DFFFFFNN
% 0.11/0.35 # partial match(1): FGHSM-FFMM31-DFFFFFNN
% 0.11/0.35 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.35 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 100s (1) cores
% 0.11/0.35 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 14238 completed with status 0
% 0.11/0.35 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.35 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.11/0.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.35 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.11/0.35 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.35 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.35 # Search class: FGUSM-FFMM31-DFFFFFNN
% 0.11/0.35 # partial match(1): FGHSM-FFMM31-DFFFFFNN
% 0.11/0.35 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.35 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 100s (1) cores
% 0.11/0.35 # Preprocessing time : 0.002 s
% 0.11/0.35 # Presaturation interreduction done
% 0.11/0.35
% 0.11/0.35 # Proof found!
% 0.11/0.35 # SZS status Theorem
% 0.11/0.35 # SZS output start CNFRefutation
% See solution above
% 0.11/0.35 # Parsed axioms : 92
% 0.11/0.35 # Removed by relevancy pruning/SinE : 23
% 0.11/0.35 # Initial clauses : 82
% 0.11/0.35 # Removed in clause preprocessing : 0
% 0.11/0.35 # Initial clauses in saturation : 82
% 0.11/0.35 # Processed clauses : 58
% 0.11/0.35 # ...of these trivial : 2
% 0.11/0.35 # ...subsumed : 0
% 0.11/0.35 # ...remaining for further processing : 55
% 0.11/0.35 # Other redundant clauses eliminated : 0
% 0.11/0.35 # Clauses deleted for lack of memory : 0
% 0.11/0.35 # Backward-subsumed : 0
% 0.11/0.35 # Backward-rewritten : 0
% 0.11/0.35 # Generated clauses : 0
% 0.11/0.35 # ...of the previous two non-redundant : 0
% 0.11/0.35 # ...aggressively subsumed : 0
% 0.11/0.35 # Contextual simplify-reflections : 0
% 0.11/0.35 # Paramodulations : 0
% 0.11/0.35 # Factorizations : 0
% 0.11/0.35 # NegExts : 0
% 0.11/0.35 # Equation resolutions : 0
% 0.11/0.35 # Disequality decompositions : 0
% 0.11/0.35 # Total rewrite steps : 14
% 0.11/0.35 # ...of those cached : 4
% 0.11/0.35 # Propositional unsat checks : 0
% 0.11/0.35 # Propositional check models : 0
% 0.11/0.35 # Propositional check unsatisfiable : 0
% 0.11/0.35 # Propositional clauses : 0
% 0.11/0.35 # Propositional clauses after purity: 0
% 0.11/0.35 # Propositional unsat core size : 0
% 0.11/0.35 # Propositional preprocessing time : 0.000
% 0.11/0.35 # Propositional encoding time : 0.000
% 0.11/0.35 # Propositional solver time : 0.000
% 0.11/0.35 # Success case prop preproc time : 0.000
% 0.11/0.35 # Success case prop encoding time : 0.000
% 0.11/0.35 # Success case prop solver time : 0.000
% 0.11/0.35 # Current number of processed clauses : 55
% 0.11/0.35 # Positive orientable unit clauses : 46
% 0.11/0.35 # Positive unorientable unit clauses: 0
% 0.11/0.35 # Negative unit clauses : 1
% 0.11/0.35 # Non-unit-clauses : 8
% 0.11/0.35 # Current number of unprocessed clauses: 24
% 0.11/0.35 # ...number of literals in the above : 61
% 0.11/0.35 # Current number of archived formulas : 0
% 0.11/0.35 # Current number of archived clauses : 0
% 0.11/0.35 # Clause-clause subsumption calls (NU) : 2
% 0.11/0.35 # Rec. Clause-clause subsumption calls : 2
% 0.11/0.35 # Non-unit clause-clause subsumptions : 0
% 0.11/0.35 # Unit Clause-clause subsumption calls : 2
% 0.11/0.35 # Rewrite failures with RHS unbound : 0
% 0.11/0.35 # BW rewrite match attempts : 4
% 0.11/0.35 # BW rewrite match successes : 0
% 0.11/0.35 # Condensation attempts : 0
% 0.11/0.35 # Condensation successes : 0
% 0.11/0.35 # Termbank termtop insertions : 4429
% 0.11/0.35 # Search garbage collected termcells : 742
% 0.11/0.35
% 0.11/0.35 # -------------------------------------------------
% 0.11/0.35 # User time : 0.005 s
% 0.11/0.35 # System time : 0.001 s
% 0.11/0.35 # Total time : 0.006 s
% 0.11/0.35 # Maximum resident set size: 2064 pages
% 0.11/0.35
% 0.11/0.35 # -------------------------------------------------
% 0.11/0.35 # User time : 0.006 s
% 0.11/0.35 # System time : 0.003 s
% 0.11/0.35 # Total time : 0.009 s
% 0.11/0.35 # Maximum resident set size: 1824 pages
% 0.11/0.35 % E---3.1 exiting
%------------------------------------------------------------------------------