TSTP Solution File: SWV161+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWV161+1 : TPTP v8.2.0. Bugfixed v3.3.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:33:30 EDT 2024
% Result : Theorem 0.18s 0.51s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 7 unt; 0 def)
% Number of atoms : 60 ( 18 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 57 ( 16 ~; 13 |; 19 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-3 aty)
% Number of variables : 22 ( 0 sgn 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cl5_nebula_norm_0011,conjecture,
( ( sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1
& leq(n0,pv10)
& leq(pv10,n135299)
& ! [X14] :
( ( leq(n0,X14)
& leq(X14,pred(pv10)) )
=> sum(n0,n4,a_select3(q,X14,tptp_sum_index)) = n1 ) )
=> ! [X18] :
( ( leq(n0,X18)
& leq(X18,pv10) )
=> sum(n0,n4,a_select3(q,X18,tptp_sum_index)) = n1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_norm_0011) ).
fof(leq_gt2,axiom,
! [X1,X2] :
( ( leq(X1,X2)
& X1 != X2 )
=> gt(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt2) ).
fof(leq_gt_pred,axiom,
! [X1,X2] :
( leq(X1,pred(X2))
<=> gt(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt_pred) ).
fof(c_0_3,negated_conjecture,
~ ( ( sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1
& leq(n0,pv10)
& leq(pv10,n135299)
& ! [X14] :
( ( leq(n0,X14)
& leq(X14,pred(pv10)) )
=> sum(n0,n4,a_select3(q,X14,tptp_sum_index)) = n1 ) )
=> ! [X18] :
( ( leq(n0,X18)
& leq(X18,pv10) )
=> sum(n0,n4,a_select3(q,X18,tptp_sum_index)) = n1 ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_norm_0011]) ).
fof(c_0_4,plain,
! [X1,X2] :
( ( leq(X1,X2)
& X1 != X2 )
=> gt(X2,X1) ),
inference(fof_simplification,[status(thm)],[leq_gt2]) ).
fof(c_0_5,negated_conjecture,
! [X28] :
( sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1
& leq(n0,pv10)
& leq(pv10,n135299)
& ( ~ leq(n0,X28)
| ~ leq(X28,pred(pv10))
| sum(n0,n4,a_select3(q,X28,tptp_sum_index)) = n1 )
& leq(n0,esk1_0)
& leq(esk1_0,pv10)
& sum(n0,n4,a_select3(q,esk1_0,tptp_sum_index)) != n1 ),
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_3])])])])]) ).
fof(c_0_6,plain,
! [X55,X56] :
( ( ~ leq(X55,pred(X56))
| gt(X56,X55) )
& ( ~ gt(X56,X55)
| leq(X55,pred(X56)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt_pred])])]) ).
fof(c_0_7,plain,
! [X45,X46] :
( ~ leq(X45,X46)
| X45 = X46
| gt(X46,X45) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_8,negated_conjecture,
sum(n0,n4,a_select3(q,esk1_0,tptp_sum_index)) != n1,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( sum(n0,n4,a_select3(q,X1,tptp_sum_index)) = n1
| ~ leq(n0,X1)
| ~ leq(X1,pred(pv10)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
leq(n0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( leq(X2,pred(X1))
| ~ gt(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( X1 = X2
| gt(X2,X1)
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
~ leq(esk1_0,pred(pv10)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_14,plain,
( X1 = X2
| leq(X1,pred(X2))
| ~ leq(X1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
leq(esk1_0,pv10),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
esk1_0 = pv10,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_17,negated_conjecture,
sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV161+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n008.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 : Sun May 19 09:27:07 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.18/0.46 Running first-order model finding
% 0.18/0.46 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.18/0.51 # Version: 3.1.0
% 0.18/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.51 # Starting sh5l with 300s (1) cores
% 0.18/0.51 # new_bool_3 with pid 7829 completed with status 0
% 0.18/0.51 # Result found by new_bool_3
% 0.18/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.51 # Search class: FGUSM-FFMM32-MFFFFFNN
% 0.18/0.51 # partial match(1): FGHSM-FFMM32-MFFFFFNN
% 0.18/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.51 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.18/0.51 # G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with pid 7832 completed with status 0
% 0.18/0.51 # Result found by G-E--_200_B02_F1_AE_CS_SP_PI_S0Y
% 0.18/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.51 # Search class: FGUSM-FFMM32-MFFFFFNN
% 0.18/0.51 # partial match(1): FGHSM-FFMM32-MFFFFFNN
% 0.18/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.51 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.18/0.51 # Preprocessing time : 0.002 s
% 0.18/0.51
% 0.18/0.51 # Proof found!
% 0.18/0.51 # SZS status Theorem
% 0.18/0.51 # SZS output start CNFRefutation
% See solution above
% 0.18/0.51 # Parsed axioms : 92
% 0.18/0.51 # Removed by relevancy pruning/SinE : 25
% 0.18/0.51 # Initial clauses : 76
% 0.18/0.51 # Removed in clause preprocessing : 0
% 0.18/0.51 # Initial clauses in saturation : 76
% 0.18/0.51 # Processed clauses : 622
% 0.18/0.51 # ...of these trivial : 26
% 0.18/0.51 # ...subsumed : 287
% 0.18/0.51 # ...remaining for further processing : 309
% 0.18/0.51 # Other redundant clauses eliminated : 0
% 0.18/0.51 # Clauses deleted for lack of memory : 0
% 0.18/0.51 # Backward-subsumed : 0
% 0.18/0.51 # Backward-rewritten : 7
% 0.18/0.51 # Generated clauses : 1304
% 0.18/0.51 # ...of the previous two non-redundant : 1026
% 0.18/0.51 # ...aggressively subsumed : 0
% 0.18/0.51 # Contextual simplify-reflections : 0
% 0.18/0.51 # Paramodulations : 1302
% 0.18/0.51 # Factorizations : 2
% 0.18/0.51 # NegExts : 0
% 0.18/0.51 # Equation resolutions : 0
% 0.18/0.51 # Disequality decompositions : 0
% 0.18/0.51 # Total rewrite steps : 852
% 0.18/0.51 # ...of those cached : 755
% 0.18/0.51 # Propositional unsat checks : 0
% 0.18/0.51 # Propositional check models : 0
% 0.18/0.51 # Propositional check unsatisfiable : 0
% 0.18/0.51 # Propositional clauses : 0
% 0.18/0.51 # Propositional clauses after purity: 0
% 0.18/0.51 # Propositional unsat core size : 0
% 0.18/0.51 # Propositional preprocessing time : 0.000
% 0.18/0.51 # Propositional encoding time : 0.000
% 0.18/0.51 # Propositional solver time : 0.000
% 0.18/0.51 # Success case prop preproc time : 0.000
% 0.18/0.51 # Success case prop encoding time : 0.000
% 0.18/0.51 # Success case prop solver time : 0.000
% 0.18/0.51 # Current number of processed clauses : 302
% 0.18/0.51 # Positive orientable unit clauses : 115
% 0.18/0.51 # Positive unorientable unit clauses: 0
% 0.18/0.51 # Negative unit clauses : 108
% 0.18/0.51 # Non-unit-clauses : 79
% 0.18/0.51 # Current number of unprocessed clauses: 477
% 0.18/0.51 # ...number of literals in the above : 1115
% 0.18/0.51 # Current number of archived formulas : 0
% 0.18/0.51 # Current number of archived clauses : 7
% 0.18/0.51 # Clause-clause subsumption calls (NU) : 438
% 0.18/0.51 # Rec. Clause-clause subsumption calls : 353
% 0.18/0.51 # Non-unit clause-clause subsumptions : 20
% 0.18/0.51 # Unit Clause-clause subsumption calls : 3149
% 0.18/0.51 # Rewrite failures with RHS unbound : 0
% 0.18/0.51 # BW rewrite match attempts : 48
% 0.18/0.51 # BW rewrite match successes : 1
% 0.18/0.51 # Condensation attempts : 0
% 0.18/0.51 # Condensation successes : 0
% 0.18/0.51 # Termbank termtop insertions : 15054
% 0.18/0.51 # Search garbage collected termcells : 668
% 0.18/0.51
% 0.18/0.51 # -------------------------------------------------
% 0.18/0.51 # User time : 0.029 s
% 0.18/0.51 # System time : 0.003 s
% 0.18/0.51 # Total time : 0.033 s
% 0.18/0.51 # Maximum resident set size: 1920 pages
% 0.18/0.51
% 0.18/0.51 # -------------------------------------------------
% 0.18/0.51 # User time : 0.034 s
% 0.18/0.51 # System time : 0.004 s
% 0.18/0.51 # Total time : 0.038 s
% 0.18/0.51 # Maximum resident set size: 1820 pages
% 0.18/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------