TSTP Solution File: SWV997_1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWV997_1 : TPTP v8.2.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:32:51 EDT 2024
% Result : Theorem 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 18
% Syntax : Number of formulae : 32 ( 9 unt; 17 typ; 0 def)
% Number of atoms : 188 ( 131 equ)
% Maximal formula atoms : 54 ( 12 avg)
% Number of connectives : 267 ( 94 ~; 45 |; 126 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 43 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 208 ( 53 atm; 0 fun; 98 num; 57 var)
% Number of types : 2 ( 0 usr; 1 ari)
% Number of type conns : 6 ( 4 >; 2 *; 0 +; 0 <<)
% Number of predicates : 5 ( 0 usr; 2 prp; 0-2 aty)
% Number of functors : 15 ( 6 usr; 13 con; 0-1 aty)
% Number of variables : 57 ( 0 sgn 57 !; 0 ?; 57 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
z1: $int ).
tff(decl_23,type,
z2: $int ).
tff(decl_24,type,
z3: $int ).
tff(decl_25,type,
z4: $int ).
tff(decl_26,type,
a: $int > $int ).
tff(decl_27,type,
b: $int > $int ).
tff(decl_28,type,
1: $int ).
tff(decl_29,type,
$lesseq: ( $int * $int ) > $o ).
tff(decl_30,type,
12: $int ).
tff(decl_31,type,
5: $int ).
tff(decl_32,type,
10: $int ).
tff(decl_33,type,
9: $int ).
tff(decl_34,type,
3: $int ).
tff(decl_35,type,
$less: ( $int * $int ) > $o ).
tff(decl_36,type,
8: $int ).
tff(decl_37,type,
7: $int ).
tff(decl_38,type,
6: $int ).
tff(0,conjecture,
( ( ! [X1: $int] :
( $lesseq(1,a(X1))
& $lesseq(a(X1),12) )
& ! [X1: $int] :
( $lesseq(1,b(X1))
& $lesseq(b(X1),5) )
& $true
& ( z1 != z2 )
& ( z1 != z3 )
& ( z1 != z4 )
& ( z2 != z3 )
& ( z2 != z4 )
& ( z3 != z4 )
& ! [X1: $int,X2: $int] :
~ ( ( X1 != X2 )
& ( a(X1) = 10 )
& ( a(X2) = 10 ) )
& ! [X1: $int,X2: $int] :
~ ( ( X1 != X2 )
& ( a(X1) = 9 )
& ( a(X2) = 10 )
& $less(b(X2),3)
& $less(X2,X1) )
& ! [X1: $int,X2: $int] :
~ ( ( X1 != X2 )
& ( a(X1) = 8 )
& ( a(X2) = 10 )
& $less(b(X2),3)
& $less(X2,X1) )
& ! [X1: $int,X2: $int,X3: $int] :
~ ( ( X1 != X2 )
& ( X1 != X3 )
& ( X2 != X3 )
& ( a(X1) = 7 )
& ( a(X2) = 10 )
& $less(b(X2),3)
& ( b(X3) = 5 )
& $less(X2,X1) )
& ! [X1: $int,X2: $int,X3: $int] :
~ ( ( X1 != X2 )
& ( X1 != X3 )
& ( X2 != X3 )
& ( a(X1) = 6 )
& ( a(X2) = 10 )
& $less(b(X2),3)
& ( b(X3) = 5 )
& $less(X2,X1) )
& ! [X1: $int,X2: $int,X3: $int] :
~ ( ( X1 != X2 )
& ( X1 != X3 )
& ( X2 != X3 )
& ( a(X1) = 7 )
& ( a(X2) = 10 )
& ( a(X3) = 8 )
& $less(b(X2),3)
& $less(X2,X1) ) )
=> ~ ( ( a(z1) = 6 )
& ( a(z2) = 10 )
& ( a(z3) = 1 )
& $less(b(z2),3)
& ( b(z3) = 5 )
& $less(z2,z1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',0) ).
tff(c_0_1,negated_conjecture,
~ ( ( ! [X1: $int] :
( $lesseq(1,a(X1))
& $lesseq(a(X1),12) )
& ! [X1: $int] :
( $lesseq(1,b(X1))
& $lesseq(b(X1),5) )
& $true
& ( z1 != z2 )
& ( z1 != z3 )
& ( z1 != z4 )
& ( z2 != z3 )
& ( z2 != z4 )
& ( z3 != z4 )
& ! [X1: $int,X2: $int] :
~ ( ( X1 != X2 )
& ( a(X1) = 10 )
& ( a(X2) = 10 ) )
& ! [X1: $int,X2: $int] :
~ ( ( X1 != X2 )
& ( a(X1) = 9 )
& ( a(X2) = 10 )
& $less(b(X2),3)
& $less(X2,X1) )
& ! [X1: $int,X2: $int] :
~ ( ( X1 != X2 )
& ( a(X1) = 8 )
& ( a(X2) = 10 )
& $less(b(X2),3)
& $less(X2,X1) )
& ! [X1: $int,X2: $int,X3: $int] :
~ ( ( X1 != X2 )
& ( X1 != X3 )
& ( X2 != X3 )
& ( a(X1) = 7 )
& ( a(X2) = 10 )
& $less(b(X2),3)
& ( b(X3) = 5 )
& $less(X2,X1) )
& ! [X1: $int,X2: $int,X3: $int] :
~ ( ( X1 != X2 )
& ( X1 != X3 )
& ( X2 != X3 )
& ( a(X1) = 6 )
& ( a(X2) = 10 )
& $less(b(X2),3)
& ( b(X3) = 5 )
& $less(X2,X1) )
& ! [X1: $int,X2: $int,X3: $int] :
~ ( ( X1 != X2 )
& ( X1 != X3 )
& ( X2 != X3 )
& ( a(X1) = 7 )
& ( a(X2) = 10 )
& ( a(X3) = 8 )
& $less(b(X2),3)
& $less(X2,X1) ) )
=> ~ ( ( a(z1) = 6 )
& ( a(z2) = 10 )
& ( a(z3) = 1 )
& $less(b(z2),3)
& ( b(z3) = 5 )
& $less(z2,z1) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[0])]) ).
tff(c_0_2,negated_conjecture,
! [X4: $int,X5: $int,X6: $int,X7: $int,X8: $int,X9: $int,X10: $int,X11: $int,X12: $int,X13: $int,X14: $int,X15: $int,X16: $int,X17: $int,X18: $int,X19: $int,X20: $int] :
( $lesseq(1,a(X4))
& $lesseq(a(X4),12)
& $lesseq(1,b(X5))
& $lesseq(b(X5),5)
& $true
& ( z1 != z2 )
& ( z1 != z3 )
& ( z1 != z4 )
& ( z2 != z3 )
& ( z2 != z4 )
& ( z3 != z4 )
& ( ( X6 = X7 )
| ( a(X6) != 10 )
| ( a(X7) != 10 ) )
& ( ( X8 = X9 )
| ( a(X8) != 9 )
| ( a(X9) != 10 )
| ~ $less(b(X9),3)
| ~ $less(X9,X8) )
& ( ( X10 = X11 )
| ( a(X10) != 8 )
| ( a(X11) != 10 )
| ~ $less(b(X11),3)
| ~ $less(X11,X10) )
& ( ( X12 = X13 )
| ( X12 = X14 )
| ( X13 = X14 )
| ( a(X12) != 7 )
| ( a(X13) != 10 )
| ~ $less(b(X13),3)
| ( b(X14) != 5 )
| ~ $less(X13,X12) )
& ( ( X15 = X16 )
| ( X15 = X17 )
| ( X16 = X17 )
| ( a(X15) != 6 )
| ( a(X16) != 10 )
| ~ $less(b(X16),3)
| ( b(X17) != 5 )
| ~ $less(X16,X15) )
& ( ( X18 = X19 )
| ( X18 = X20 )
| ( X19 = X20 )
| ( a(X18) != 7 )
| ( a(X19) != 10 )
| ( a(X20) != 8 )
| ~ $less(b(X19),3)
| ~ $less(X19,X18) )
& ( a(z1) = 6 )
& ( a(z2) = 10 )
& ( a(z3) = 1 )
& $less(b(z2),3)
& ( b(z3) = 5 )
& $less(z2,z1) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).
tcf(c_0_3,negated_conjecture,
! [X3: $int,X2: $int,X1: $int] :
( ( X1 = X2 )
| ( X1 = X3 )
| ( X2 = X3 )
| ( a(X1) != 6 )
| ( a(X2) != 10 )
| ~ $less(b(X2),3)
| ( b(X3) != 5 )
| ~ $less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
tcf(c_0_4,negated_conjecture,
$less(b(z2),3),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
tcf(c_0_5,negated_conjecture,
a(z2) = 10,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
tcf(c_0_6,negated_conjecture,
! [X2: $int,X1: $int] :
( ( X1 = z2 )
| ( z2 = X2 )
| ( X1 = X2 )
| ( a(X1) != 6 )
| ( b(X2) != 5 )
| ~ $less(z2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5])]) ).
tcf(c_0_7,negated_conjecture,
$less(z2,z1),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
tcf(c_0_8,negated_conjecture,
a(z1) = 6,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
tcf(c_0_9,negated_conjecture,
z1 != z2,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
tcf(c_0_10,negated_conjecture,
! [X1: $int] :
( ( z1 = X1 )
| ( z2 = X1 )
| ( b(X1) != 5 ) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]),c_0_9]) ).
tcf(c_0_11,negated_conjecture,
b(z3) = 5,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
tcf(c_0_12,negated_conjecture,
z1 != z3,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
tcf(c_0_13,negated_conjecture,
z2 != z3,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWV997_1 : TPTP v8.2.0. Released v5.0.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.36 % Computer : n015.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Sun May 19 07:14:53 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.20/0.50 Running first-order theorem proving
% 0.20/0.50 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.51 # Version: 3.1.0
% 0.20/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # new_bool_3 with pid 15854 completed with status 0
% 0.20/0.51 # Result found by new_bool_3
% 0.20/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51 # Search class: FGUSM-FFSM11-SFFFFFNN
% 0.20/0.51 # partial match(1): FGUSF-FFSM11-SFFFFFNN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.51 # SAT001_MinMin_p005000_rr_RG with pid 15857 completed with status 0
% 0.20/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51 # Search class: FGUSM-FFSM11-SFFFFFNN
% 0.20/0.51 # partial match(1): FGUSF-FFSM11-SFFFFFNN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.51 # Preprocessing time : 0.001 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Theorem
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 7
% 0.20/0.51 # Removed by relevancy pruning/SinE : 6
% 0.20/0.51 # Initial clauses : 23
% 0.20/0.51 # Removed in clause preprocessing : 1
% 0.20/0.51 # Initial clauses in saturation : 22
% 0.20/0.51 # Processed clauses : 59
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 0
% 0.20/0.51 # ...remaining for further processing : 59
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 0
% 0.20/0.51 # Backward-rewritten : 0
% 0.20/0.51 # Generated clauses : 25
% 0.20/0.51 # ...of the previous two non-redundant : 15
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 0
% 0.20/0.51 # Paramodulations : 25
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 0
% 0.20/0.51 # Disequality decompositions : 0
% 0.20/0.51 # Total rewrite steps : 15
% 0.20/0.51 # ...of those cached : 12
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 37
% 0.20/0.51 # Positive orientable unit clauses : 18
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 6
% 0.20/0.51 # Non-unit-clauses : 13
% 0.20/0.51 # Current number of unprocessed clauses: 0
% 0.20/0.51 # ...number of literals in the above : 0
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 22
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 110
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 17
% 0.20/0.51 # Non-unit clause-clause subsumptions : 0
% 0.20/0.51 # Unit Clause-clause subsumption calls : 0
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 0
% 0.20/0.51 # BW rewrite match successes : 0
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 2391
% 0.20/0.51 # Search garbage collected termcells : 578
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.005 s
% 0.20/0.51 # System time : 0.003 s
% 0.20/0.51 # Total time : 0.007 s
% 0.20/0.51 # Maximum resident set size: 1892 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.005 s
% 0.20/0.51 # System time : 0.006 s
% 0.20/0.51 # Total time : 0.011 s
% 0.20/0.51 # Maximum resident set size: 1700 pages
% 0.20/0.51 % E---3.1 exiting
% 0.20/0.51 % E exiting
%------------------------------------------------------------------------------