TSTP Solution File: NUM657_8 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM657_8 : TPTP v8.2.0. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:29 EDT 2024
% Result : Theorem 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 20 ( 6 unt; 5 typ; 0 def)
% Number of atoms : 36 ( 12 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 52 ( 31 ~; 7 |; 2 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 11 ( 0 sgn 11 !; 0 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
nat: $tType ).
tff(decl_22,type,
x: nat ).
tff(decl_23,type,
y: nat ).
tff(decl_24,type,
less: ( nat * nat ) > $o ).
tff(decl_25,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/sandbox/benchmark/theBenchmark.p',satz10b) ).
tff(satz10h,conjecture,
~ ( ~ more(x,y)
=> ( x = y ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz10h) ).
tff(l,axiom,
less(x,y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l) ).
tff(c_0_3,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_4,negated_conjecture,
~ ~ ( ~ more(x,y)
=> ( x = y ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz10h])]) ).
tff(c_0_5,plain,
! [X4: nat,X5: nat] :
( ( ( X4 != X5 )
| ~ more(X4,X5) )
& ( ~ more(X4,X5)
| ~ less(X4,X5) )
& ( ~ less(X4,X5)
| ( X4 != X5 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
tff(c_0_6,negated_conjecture,
( more(x,y)
| ( x = y ) ),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
tcf(c_0_7,plain,
! [X2: nat,X3: nat] :
( ~ more(X2,X3)
| ~ less(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
tcf(c_0_8,plain,
less(x,y),
inference(split_conjunct,[status(thm)],[l]) ).
tcf(c_0_9,negated_conjecture,
( more(x,y)
| ( x = y ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_10,plain,
~ more(x,y),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
tcf(c_0_11,plain,
! [X2: nat,X3: nat] :
( ~ less(X2,X3)
| ( X2 != X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
tcf(c_0_12,negated_conjecture,
x = y,
inference(sr,[status(thm)],[c_0_9,c_0_10]) ).
tcf(c_0_13,plain,
! [X2: nat] : ~ less(X2,X2),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_12]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM657_8 : TPTP v8.2.0. Released v8.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n002.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 03:42:08 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 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.20/0.48 # Version: 3.1.0
% 0.20/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 # Starting sh5l with 300s (1) cores
% 0.20/0.48 # new_bool_1 with pid 2033 completed with status 0
% 0.20/0.48 # Result found by new_bool_1
% 0.20/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.48 # Search class: FGHSF-FFSF00-SFFFFFNN
% 0.20/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mA with 181s (1) cores
% 0.20/0.48 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mA with pid 2036 completed with status 0
% 0.20/0.48 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mA
% 0.20/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.48 # Search class: FGHSF-FFSF00-SFFFFFNN
% 0.20/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mA with 181s (1) cores
% 0.20/0.48 # Preprocessing time : 0.001 s
% 0.20/0.48 # Presaturation interreduction done
% 0.20/0.48
% 0.20/0.48 # Proof found!
% 0.20/0.48 # SZS status Theorem
% 0.20/0.48 # SZS output start CNFRefutation
% See solution above
% 0.20/0.48 # Parsed axioms : 9
% 0.20/0.48 # Removed by relevancy pruning/SinE : 6
% 0.20/0.48 # Initial clauses : 5
% 0.20/0.48 # Removed in clause preprocessing : 0
% 0.20/0.48 # Initial clauses in saturation : 5
% 0.20/0.48 # Processed clauses : 13
% 0.20/0.48 # ...of these trivial : 0
% 0.20/0.48 # ...subsumed : 0
% 0.20/0.48 # ...remaining for further processing : 13
% 0.20/0.48 # Other redundant clauses eliminated : 2
% 0.20/0.48 # Clauses deleted for lack of memory : 0
% 0.20/0.48 # Backward-subsumed : 0
% 0.20/0.48 # Backward-rewritten : 2
% 0.20/0.48 # Generated clauses : 3
% 0.20/0.48 # ...of the previous two non-redundant : 4
% 0.20/0.48 # ...aggressively subsumed : 0
% 0.20/0.48 # Contextual simplify-reflections : 0
% 0.20/0.48 # Paramodulations : 1
% 0.20/0.48 # Factorizations : 0
% 0.20/0.48 # NegExts : 0
% 0.20/0.48 # Equation resolutions : 2
% 0.20/0.48 # Disequality decompositions : 0
% 0.20/0.48 # Total rewrite steps : 2
% 0.20/0.48 # ...of those cached : 1
% 0.20/0.48 # Propositional unsat checks : 0
% 0.20/0.48 # Propositional check models : 0
% 0.20/0.48 # Propositional check unsatisfiable : 0
% 0.20/0.48 # Propositional clauses : 0
% 0.20/0.48 # Propositional clauses after purity: 0
% 0.20/0.48 # Propositional unsat core size : 0
% 0.20/0.48 # Propositional preprocessing time : 0.000
% 0.20/0.48 # Propositional encoding time : 0.000
% 0.20/0.48 # Propositional solver time : 0.000
% 0.20/0.48 # Success case prop preproc time : 0.000
% 0.20/0.48 # Success case prop encoding time : 0.000
% 0.20/0.48 # Success case prop solver time : 0.000
% 0.20/0.48 # Current number of processed clauses : 4
% 0.20/0.48 # Positive orientable unit clauses : 1
% 0.20/0.48 # Positive unorientable unit clauses: 0
% 0.20/0.48 # Negative unit clauses : 2
% 0.20/0.48 # Non-unit-clauses : 1
% 0.20/0.48 # Current number of unprocessed clauses: 0
% 0.20/0.48 # ...number of literals in the above : 0
% 0.20/0.48 # Current number of archived formulas : 0
% 0.20/0.48 # Current number of archived clauses : 7
% 0.20/0.48 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.48 # Non-unit clause-clause subsumptions : 0
% 0.20/0.48 # Unit Clause-clause subsumption calls : 2
% 0.20/0.48 # Rewrite failures with RHS unbound : 0
% 0.20/0.48 # BW rewrite match attempts : 1
% 0.20/0.48 # BW rewrite match successes : 1
% 0.20/0.48 # Condensation attempts : 0
% 0.20/0.48 # Condensation successes : 0
% 0.20/0.48 # Termbank termtop insertions : 341
% 0.20/0.48 # Search garbage collected termcells : 71
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.004 s
% 0.20/0.48 # System time : 0.000 s
% 0.20/0.48 # Total time : 0.004 s
% 0.20/0.48 # Maximum resident set size: 1584 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.007 s
% 0.20/0.48 # System time : 0.001 s
% 0.20/0.48 # Total time : 0.007 s
% 0.20/0.48 # Maximum resident set size: 1700 pages
% 0.20/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------