TSTP Solution File: NUM667_8 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM667_8 : TPTP v8.1.2. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:08:12 EDT 2023
% Result : Theorem 0.14s 0.39s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 25 ( 4 unt; 4 typ; 0 def)
% Number of atoms : 48 ( 19 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 47 ( 20 ~; 13 |; 2 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 13 ( 0 sgn; 13 !; 0 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
x: nat ).
tff(decl_23,type,
y: nat ).
tff(decl_24,type,
z: nat ).
tff(decl_25,type,
less: ( nat * nat ) > $o ).
tff(satz16b,axiom,
! [X2: nat,X3: nat,X4: nat] :
( less(X2,X3)
=> ( ( ~ less(X3,X4)
=> ( X3 = X4 ) )
=> less(X2,X4) ) ),
file('/export/starexec/sandbox2/tmp/tmp.HXCl08HTLJ/E---3.1_5383.p',satz16b) ).
tff(l,axiom,
( ~ less(x,y)
=> ( x = y ) ),
file('/export/starexec/sandbox2/tmp/tmp.HXCl08HTLJ/E---3.1_5383.p',l) ).
tff(k,axiom,
( ~ less(y,z)
=> ( y = z ) ),
file('/export/starexec/sandbox2/tmp/tmp.HXCl08HTLJ/E---3.1_5383.p',k) ).
tff(satz17,conjecture,
( ~ less(x,z)
=> ( x = z ) ),
file('/export/starexec/sandbox2/tmp/tmp.HXCl08HTLJ/E---3.1_5383.p',satz17) ).
tff(c_0_4,plain,
! [X2: nat,X3: nat,X4: nat] :
( less(X2,X3)
=> ( ( ~ less(X3,X4)
=> ( X3 = X4 ) )
=> less(X2,X4) ) ),
inference(fof_simplification,[status(thm)],[satz16b]) ).
tff(c_0_5,plain,
( ~ less(x,y)
=> ( x = y ) ),
inference(fof_simplification,[status(thm)],[l]) ).
tff(c_0_6,plain,
! [X8: nat,X9: nat,X10: nat] :
( ( ~ less(X9,X10)
| less(X8,X10)
| ~ less(X8,X9) )
& ( ( X9 != X10 )
| less(X8,X10)
| ~ less(X8,X9) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
tff(c_0_7,plain,
( less(x,y)
| ( x = y ) ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
tff(c_0_8,plain,
( ~ less(y,z)
=> ( y = z ) ),
inference(fof_simplification,[status(thm)],[k]) ).
tff(c_0_9,negated_conjecture,
~ ( ~ less(x,z)
=> ( x = z ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz17])]) ).
tcf(c_0_10,plain,
! [X4: nat,X3: nat,X2: nat] :
( less(X4,X3)
| ~ less(X2,X3)
| ~ less(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_11,plain,
( less(x,y)
| ( x = y ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tff(c_0_12,plain,
( less(y,z)
| ( y = z ) ),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
tff(c_0_13,negated_conjecture,
( ~ less(x,z)
& ( x != z ) ),
inference(fof_nnf,[status(thm)],[c_0_9]) ).
tcf(c_0_14,plain,
! [X2: nat] :
( ( y = x )
| less(x,X2)
| ~ less(y,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
tcf(c_0_15,plain,
( less(y,z)
| ( y = z ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tcf(c_0_16,negated_conjecture,
~ less(x,z),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tcf(c_0_17,plain,
( ( z = y )
| ( y = x ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
tcf(c_0_18,negated_conjecture,
y = x,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_11]) ).
tcf(c_0_19,negated_conjecture,
x != z,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_18]),c_0_18]),c_0_19]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : NUM667_8 : TPTP v8.1.2. Released v8.0.0.
% 0.00/0.09 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n031.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 2400
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon Oct 2 14:04:13 EDT 2023
% 0.09/0.29 % CPUTime :
% 0.14/0.38 Running first-order model finding
% 0.14/0.38 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/tmp/tmp.HXCl08HTLJ/E---3.1_5383.p
% 0.14/0.39 # Version: 3.1pre001
% 0.14/0.39 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.39 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.39 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.39 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.39 # Starting sh5l with 300s (1) cores
% 0.14/0.39 # new_bool_3 with pid 5461 completed with status 0
% 0.14/0.39 # Result found by new_bool_3
% 0.14/0.39 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.39 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.39 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.39 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.39 # Search class: FGUSF-FFSF00-SFFFFFNN
% 0.14/0.39 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.39 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.14/0.39 # SAT001_MinMin_p005000_rr_RG with pid 5464 completed with status 0
% 0.14/0.39 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.14/0.39 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.39 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.39 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.39 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.39 # Search class: FGUSF-FFSF00-SFFFFFNN
% 0.14/0.39 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.39 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.14/0.39 # Preprocessing time : 0.001 s
% 0.14/0.39 # Presaturation interreduction done
% 0.14/0.39
% 0.14/0.39 # Proof found!
% 0.14/0.39 # SZS status Theorem
% 0.14/0.39 # SZS output start CNFRefutation
% See solution above
% 0.14/0.39 # Parsed axioms : 11
% 0.14/0.39 # Removed by relevancy pruning/SinE : 6
% 0.14/0.39 # Initial clauses : 8
% 0.14/0.39 # Removed in clause preprocessing : 2
% 0.14/0.39 # Initial clauses in saturation : 6
% 0.14/0.39 # Processed clauses : 15
% 0.14/0.39 # ...of these trivial : 0
% 0.14/0.39 # ...subsumed : 1
% 0.14/0.39 # ...remaining for further processing : 14
% 0.14/0.39 # Other redundant clauses eliminated : 0
% 0.14/0.39 # Clauses deleted for lack of memory : 0
% 0.14/0.39 # Backward-subsumed : 0
% 0.14/0.39 # Backward-rewritten : 5
% 0.14/0.39 # Generated clauses : 5
% 0.14/0.39 # ...of the previous two non-redundant : 5
% 0.14/0.39 # ...aggressively subsumed : 0
% 0.14/0.39 # Contextual simplify-reflections : 1
% 0.14/0.39 # Paramodulations : 5
% 0.14/0.39 # Factorizations : 0
% 0.14/0.39 # NegExts : 0
% 0.14/0.39 # Equation resolutions : 0
% 0.14/0.39 # Total rewrite steps : 10
% 0.14/0.39 # Propositional unsat checks : 0
% 0.14/0.39 # Propositional check models : 0
% 0.14/0.39 # Propositional check unsatisfiable : 0
% 0.14/0.39 # Propositional clauses : 0
% 0.14/0.39 # Propositional clauses after purity: 0
% 0.14/0.39 # Propositional unsat core size : 0
% 0.14/0.39 # Propositional preprocessing time : 0.000
% 0.14/0.39 # Propositional encoding time : 0.000
% 0.14/0.39 # Propositional solver time : 0.000
% 0.14/0.39 # Success case prop preproc time : 0.000
% 0.14/0.39 # Success case prop encoding time : 0.000
% 0.14/0.39 # Success case prop solver time : 0.000
% 0.14/0.39 # Current number of processed clauses : 4
% 0.14/0.39 # Positive orientable unit clauses : 1
% 0.14/0.39 # Positive unorientable unit clauses: 0
% 0.14/0.39 # Negative unit clauses : 2
% 0.14/0.39 # Non-unit-clauses : 1
% 0.14/0.39 # Current number of unprocessed clauses: 0
% 0.14/0.39 # ...number of literals in the above : 0
% 0.14/0.39 # Current number of archived formulas : 0
% 0.14/0.39 # Current number of archived clauses : 10
% 0.14/0.39 # Clause-clause subsumption calls (NU) : 4
% 0.14/0.39 # Rec. Clause-clause subsumption calls : 2
% 0.14/0.39 # Non-unit clause-clause subsumptions : 2
% 0.14/0.39 # Unit Clause-clause subsumption calls : 0
% 0.14/0.39 # Rewrite failures with RHS unbound : 0
% 0.14/0.39 # BW rewrite match attempts : 1
% 0.14/0.39 # BW rewrite match successes : 1
% 0.14/0.39 # Condensation attempts : 0
% 0.14/0.39 # Condensation successes : 0
% 0.14/0.39 # Termbank termtop insertions : 457
% 0.14/0.39
% 0.14/0.39 # -------------------------------------------------
% 0.14/0.39 # User time : 0.002 s
% 0.14/0.39 # System time : 0.002 s
% 0.14/0.39 # Total time : 0.004 s
% 0.14/0.39 # Maximum resident set size: 1756 pages
% 0.14/0.39
% 0.14/0.39 # -------------------------------------------------
% 0.14/0.39 # User time : 0.002 s
% 0.14/0.39 # System time : 0.004 s
% 0.14/0.39 # Total time : 0.007 s
% 0.14/0.39 # Maximum resident set size: 1692 pages
% 0.14/0.39 % E---3.1 exiting
%------------------------------------------------------------------------------