TSTP Solution File: NUM681_8 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM681_8 : TPTP v8.2.0. Released v8.0.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 01:27:37 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of formulae : 35 ( 11 unt; 7 typ; 0 def)
% Number of atoms : 61 ( 18 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 74 ( 41 ~; 15 |; 2 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn 40 !; 0 ?; 40 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
nat: $tType ).
tff(decl_22,type,
x: nat ).
tff(decl_23,type,
y: nat ).
tff(decl_24,type,
z: nat ).
tff(decl_25,type,
pl: ( nat * nat ) > nat ).
tff(decl_26,type,
less: ( nat * nat ) > $o ).
tff(decl_27,type,
more: ( nat * nat ) > $o ).
tff(satz10b,axiom,
! [X2: nat,X3: nat] :
~ ( ( ( X2 = X3 )
=> ~ more(X2,X3) )
=> ~ ~ ( ( more(X2,X3)
=> ~ less(X2,X3) )
=> ~ ( less(X2,X3)
=> ( X2 != X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz10b) ).
tff(satz19a,axiom,
! [X2: nat,X3: nat,X4: nat] :
( more(X2,X3)
=> more(pl(X2,X4),pl(X3,X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz19a) ).
tff(satz19c,axiom,
! [X2: nat,X3: nat,X4: nat] :
( less(X2,X3)
=> less(pl(X2,X4),pl(X3,X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz19c) ).
tff(i,axiom,
pl(x,z) = pl(y,z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',i) ).
tff(satz10a,axiom,
! [X2: nat,X3: nat] :
( ( X2 != X3 )
=> ( ~ more(X2,X3)
=> less(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz10a) ).
tff(satz20b,conjecture,
x = y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz20b) ).
tff(c_0_6,plain,
! [X2: nat,X3: nat] :
~ ( ( ( X2 = X3 )
=> ~ more(X2,X3) )
=> ~ ~ ( ( more(X2,X3)
=> ~ less(X2,X3) )
=> ~ ( less(X2,X3)
=> ( X2 != X3 ) ) ) ),
inference(fof_simplification,[status(thm)],[satz10b]) ).
tff(c_0_7,plain,
! [X11: nat,X12: nat] :
( ( ( X11 != X12 )
| ~ more(X11,X12) )
& ( ~ more(X11,X12)
| ~ less(X11,X12) )
& ( ~ less(X11,X12)
| ( X11 != X12 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
tff(c_0_8,plain,
! [X8: nat,X9: nat,X10: nat] :
( ~ more(X8,X9)
| more(pl(X8,X10),pl(X9,X10)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz19a])])]) ).
tff(c_0_9,plain,
! [X5: nat,X6: nat,X7: nat] :
( ~ less(X5,X6)
| less(pl(X5,X7),pl(X6,X7)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz19c])])]) ).
tcf(c_0_10,plain,
! [X2: nat,X3: nat] :
( ( X2 != X3 )
| ~ more(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_11,plain,
! [X2: nat,X4: nat,X3: nat] :
( more(pl(X2,X4),pl(X3,X4))
| ~ more(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_12,plain,
pl(x,z) = pl(y,z),
inference(split_conjunct,[status(thm)],[i]) ).
tff(c_0_13,plain,
! [X2: nat,X3: nat] :
( ( X2 != X3 )
=> ( ~ more(X2,X3)
=> less(X2,X3) ) ),
inference(fof_simplification,[status(thm)],[satz10a]) ).
tff(c_0_14,negated_conjecture,
x != y,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz20b])]) ).
tcf(c_0_15,plain,
! [X2: nat,X3: nat] :
( ~ less(X2,X3)
| ( X2 != X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_16,plain,
! [X2: nat,X4: nat,X3: nat] :
( less(pl(X2,X4),pl(X3,X4))
| ~ less(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_17,plain,
! [X2: nat] : ~ more(X2,X2),
inference(er,[status(thm)],[c_0_10]) ).
tcf(c_0_18,plain,
! [X2: nat] :
( more(pl(X2,z),pl(x,z))
| ~ more(X2,y) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
tff(c_0_19,plain,
! [X13: nat,X14: nat] :
( ( X13 = X14 )
| more(X13,X14)
| less(X13,X14) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])]) ).
tff(c_0_20,negated_conjecture,
x != y,
inference(fof_nnf,[status(thm)],[c_0_14]) ).
tcf(c_0_21,plain,
! [X2: nat] : ~ less(X2,X2),
inference(er,[status(thm)],[c_0_15]) ).
tcf(c_0_22,plain,
! [X2: nat] :
( less(pl(X2,z),pl(x,z))
| ~ less(X2,y) ),
inference(spm,[status(thm)],[c_0_16,c_0_12]) ).
tcf(c_0_23,plain,
~ more(x,y),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
tcf(c_0_24,plain,
! [X2: nat,X3: nat] :
( ( X2 = X3 )
| more(X2,X3)
| less(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
tcf(c_0_25,negated_conjecture,
x != y,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
tcf(c_0_26,plain,
~ less(x,y),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM681_8 : TPTP v8.2.0. Released v8.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 05:02:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 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.20/0.49 # Version: 3.1.0
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # sh5l with pid 10517 completed with status 0
% 0.20/0.49 # Result found by sh5l
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.49 # Search class: FGHSF-FFSF22-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49 # SAT001_MinMin_p005000_rr_RG with pid 10523 completed with status 0
% 0.20/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.49 # Search class: FGHSF-FFSF22-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 14
% 0.20/0.49 # Removed by relevancy pruning/SinE : 8
% 0.20/0.49 # Initial clauses : 8
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 8
% 0.20/0.49 # Processed clauses : 32
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 5
% 0.20/0.49 # ...remaining for further processing : 27
% 0.20/0.49 # Other redundant clauses eliminated : 2
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 24
% 0.20/0.49 # ...of the previous two non-redundant : 22
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 22
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 2
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 0
% 0.20/0.49 # ...of those cached : 0
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 17
% 0.20/0.49 # Positive orientable unit clauses : 1
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 6
% 0.20/0.49 # Non-unit-clauses : 10
% 0.20/0.49 # Current number of unprocessed clauses: 6
% 0.20/0.49 # ...number of literals in the above : 11
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 8
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 11
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 8
% 0.20/0.49 # Non-unit clause-clause subsumptions : 1
% 0.20/0.49 # Unit Clause-clause subsumption calls : 3
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 0
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 832
% 0.20/0.49 # Search garbage collected termcells : 103
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.005 s
% 0.20/0.49 # System time : 0.001 s
% 0.20/0.49 # Total time : 0.006 s
% 0.20/0.49 # Maximum resident set size: 1744 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.005 s
% 0.20/0.49 # System time : 0.004 s
% 0.20/0.49 # Total time : 0.009 s
% 0.20/0.49 # Maximum resident set size: 1712 pages
% 0.20/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------