TSTP Solution File: NUM681_8 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM681_8 : TPTP v8.1.2. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:15 EDT 2023
% Result : Theorem 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of formulae : 33 ( 10 unt; 6 typ; 0 def)
% Number of atoms : 60 ( 17 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 73 ( 40 ~; 15 |; 2 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 2 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_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/tmp/tmp.jGToA5dB2t/E---3.1_8487.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/tmp/tmp.jGToA5dB2t/E---3.1_8487.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/tmp/tmp.jGToA5dB2t/E---3.1_8487.p',satz19c) ).
tff(i,axiom,
pl(x,z) = pl(y,z),
file('/export/starexec/sandbox2/tmp/tmp.jGToA5dB2t/E---3.1_8487.p',i) ).
tff(satz10a,axiom,
! [X2: nat,X3: nat] :
( ( X2 != X3 )
=> ( ~ more(X2,X3)
=> less(X2,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.jGToA5dB2t/E---3.1_8487.p',satz10a) ).
tff(satz20b,conjecture,
x = y,
file('/export/starexec/sandbox2/tmp/tmp.jGToA5dB2t/E---3.1_8487.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,
! [X5: nat,X6: nat] :
( ( ( X5 != X6 )
| ~ more(X5,X6) )
& ( ~ more(X5,X6)
| ~ less(X5,X6) )
& ( ~ less(X5,X6)
| ( X5 != X6 ) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).
tff(c_0_8,plain,
! [X12: nat,X13: nat,X14: nat] :
( ~ more(X12,X13)
| more(pl(X12,X14),pl(X13,X14)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz19a])]) ).
tff(c_0_9,plain,
! [X7: nat,X8: nat,X9: nat] :
( ~ less(X7,X8)
| less(pl(X7,X9),pl(X8,X9)) ),
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]) ).
tcf(c_0_14,plain,
! [X2: nat,X3: nat] :
( ~ less(X2,X3)
| ( X2 != X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_15,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_16,plain,
! [X2: nat] : ~ more(X2,X2),
inference(er,[status(thm)],[c_0_10]) ).
tcf(c_0_17,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_18,plain,
! [X10: nat,X11: nat] :
( ( X10 = X11 )
| more(X10,X11)
| less(X10,X11) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])]) ).
tff(c_0_19,negated_conjecture,
x != y,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz20b])]) ).
tcf(c_0_20,plain,
! [X2: nat] : ~ less(X2,X2),
inference(er,[status(thm)],[c_0_14]) ).
tcf(c_0_21,plain,
! [X2: nat] :
( less(pl(X2,z),pl(x,z))
| ~ less(X2,y) ),
inference(spm,[status(thm)],[c_0_15,c_0_12]) ).
tcf(c_0_22,plain,
~ more(x,y),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
tcf(c_0_23,plain,
! [X2: nat,X3: nat] :
( ( X2 = X3 )
| more(X2,X3)
| less(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
tcf(c_0_24,negated_conjecture,
x != y,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
tcf(c_0_25,plain,
~ less(x,y),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : NUM681_8 : TPTP v8.1.2. Released v8.0.0.
% 0.11/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n013.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon Oct 2 13:47:29 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order model finding
% 0.16/0.43 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.jGToA5dB2t/E---3.1_8487.p
% 0.16/0.44 # Version: 3.1pre001
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 8568 completed with status 0
% 0.16/0.44 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # No SInE strategy applied
% 0.16/0.44 # Search class: FGHSF-FFSF22-SFFFFFNN
% 0.16/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.44 # Starting new_bool_3 with 136s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 136s (1) cores
% 0.16/0.44 # Starting sh5l with 136s (1) cores
% 0.16/0.44 # SAT001_MinMin_p005000_rr_RG with pid 8576 completed with status 0
% 0.16/0.44 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # No SInE strategy applied
% 0.16/0.44 # Search class: FGHSF-FFSF22-SFFFFFNN
% 0.16/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.16/0.44 # Preprocessing time : 0.001 s
% 0.16/0.44 # Presaturation interreduction done
% 0.16/0.44
% 0.16/0.44 # Proof found!
% 0.16/0.44 # SZS status Theorem
% 0.16/0.44 # SZS output start CNFRefutation
% See solution above
% 0.16/0.44 # Parsed axioms : 14
% 0.16/0.44 # Removed by relevancy pruning/SinE : 0
% 0.16/0.44 # Initial clauses : 16
% 0.16/0.44 # Removed in clause preprocessing : 8
% 0.16/0.44 # Initial clauses in saturation : 8
% 0.16/0.44 # Processed clauses : 32
% 0.16/0.44 # ...of these trivial : 0
% 0.16/0.44 # ...subsumed : 5
% 0.16/0.44 # ...remaining for further processing : 27
% 0.16/0.44 # Other redundant clauses eliminated : 2
% 0.16/0.44 # Clauses deleted for lack of memory : 0
% 0.16/0.44 # Backward-subsumed : 0
% 0.16/0.44 # Backward-rewritten : 0
% 0.16/0.44 # Generated clauses : 24
% 0.16/0.44 # ...of the previous two non-redundant : 22
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 0
% 0.16/0.44 # Paramodulations : 22
% 0.16/0.44 # Factorizations : 0
% 0.16/0.44 # NegExts : 0
% 0.16/0.44 # Equation resolutions : 2
% 0.16/0.44 # Total rewrite steps : 0
% 0.16/0.44 # Propositional unsat checks : 0
% 0.16/0.44 # Propositional check models : 0
% 0.16/0.44 # Propositional check unsatisfiable : 0
% 0.16/0.44 # Propositional clauses : 0
% 0.16/0.44 # Propositional clauses after purity: 0
% 0.16/0.44 # Propositional unsat core size : 0
% 0.16/0.44 # Propositional preprocessing time : 0.000
% 0.16/0.44 # Propositional encoding time : 0.000
% 0.16/0.44 # Propositional solver time : 0.000
% 0.16/0.44 # Success case prop preproc time : 0.000
% 0.16/0.44 # Success case prop encoding time : 0.000
% 0.16/0.44 # Success case prop solver time : 0.000
% 0.16/0.44 # Current number of processed clauses : 17
% 0.16/0.44 # Positive orientable unit clauses : 1
% 0.16/0.44 # Positive unorientable unit clauses: 0
% 0.16/0.44 # Negative unit clauses : 6
% 0.16/0.44 # Non-unit-clauses : 10
% 0.16/0.44 # Current number of unprocessed clauses: 6
% 0.16/0.44 # ...number of literals in the above : 11
% 0.16/0.44 # Current number of archived formulas : 0
% 0.16/0.44 # Current number of archived clauses : 8
% 0.16/0.44 # Clause-clause subsumption calls (NU) : 11
% 0.16/0.44 # Rec. Clause-clause subsumption calls : 8
% 0.16/0.44 # Non-unit clause-clause subsumptions : 1
% 0.16/0.44 # Unit Clause-clause subsumption calls : 3
% 0.16/0.44 # Rewrite failures with RHS unbound : 0
% 0.16/0.44 # BW rewrite match attempts : 0
% 0.16/0.44 # BW rewrite match successes : 0
% 0.16/0.44 # Condensation attempts : 0
% 0.16/0.44 # Condensation successes : 0
% 0.16/0.44 # Termbank termtop insertions : 802
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.003 s
% 0.16/0.44 # System time : 0.002 s
% 0.16/0.44 # Total time : 0.005 s
% 0.16/0.44 # Maximum resident set size: 1684 pages
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.015 s
% 0.16/0.44 # System time : 0.003 s
% 0.16/0.44 # Total time : 0.018 s
% 0.16/0.44 # Maximum resident set size: 1696 pages
% 0.16/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------