TSTP Solution File: NUM743_8 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM743_8 : TPTP v8.1.2. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:25 EDT 2023
% Result : Theorem 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of formulae : 26 ( 9 unt; 5 typ; 0 def)
% Number of atoms : 44 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 40 ( 17 ~; 16 |; 0 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 27 ( 0 sgn; 27 !; 0 ?; 27 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
x: frac ).
tff(decl_23,type,
y: frac ).
tff(decl_24,type,
z: frac ).
tff(decl_25,type,
lessf: ( frac * frac ) > $o ).
tff(decl_26,type,
eq: ( frac * frac ) > $o ).
tff(k,axiom,
( ~ lessf(y,z)
=> eq(y,z) ),
file('/export/starexec/sandbox2/tmp/tmp.qkrko0UKmF/E---3.1_16118.p',k) ).
tff(satz45,axiom,
! [X2: frac,X3: frac,X4: frac,X5: frac] :
( lessf(X2,X3)
=> ( eq(X2,X4)
=> ( eq(X3,X5)
=> lessf(X4,X5) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qkrko0UKmF/E---3.1_16118.p',satz45) ).
tff(satz37,axiom,
! [X2: frac] : eq(X2,X2),
file('/export/starexec/sandbox2/tmp/tmp.qkrko0UKmF/E---3.1_16118.p',satz37) ).
tff(satz50,axiom,
! [X2: frac,X3: frac,X4: frac] :
( lessf(X2,X3)
=> ( lessf(X3,X4)
=> lessf(X2,X4) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qkrko0UKmF/E---3.1_16118.p',satz50) ).
tff(satz51b,conjecture,
lessf(x,z),
file('/export/starexec/sandbox2/tmp/tmp.qkrko0UKmF/E---3.1_16118.p',satz51b) ).
tff(l,axiom,
lessf(x,y),
file('/export/starexec/sandbox2/tmp/tmp.qkrko0UKmF/E---3.1_16118.p',l) ).
tff(c_0_6,plain,
( ~ lessf(y,z)
=> eq(y,z) ),
inference(fof_simplification,[status(thm)],[k]) ).
tff(c_0_7,plain,
! [X9: frac,X10: frac,X11: frac,X12: frac] :
( ~ lessf(X9,X10)
| ~ eq(X9,X11)
| ~ eq(X10,X12)
| lessf(X11,X12) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz45])]) ).
tff(c_0_8,plain,
( lessf(y,z)
| eq(y,z) ),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
tcf(c_0_9,plain,
! [X2: frac,X3: frac,X4: frac,X5: frac] :
( lessf(X4,X5)
| ~ lessf(X2,X3)
| ~ eq(X2,X4)
| ~ eq(X3,X5) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_10,plain,
( lessf(y,z)
| eq(y,z) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tff(c_0_11,plain,
! [X13: frac] : eq(X13,X13),
inference(variable_rename,[status(thm)],[satz37]) ).
tff(c_0_12,plain,
! [X6: frac,X7: frac,X8: frac] :
( ~ lessf(X6,X7)
| ~ lessf(X7,X8)
| lessf(X6,X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz50])]) ).
tff(c_0_13,negated_conjecture,
~ lessf(x,z),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz51b])]) ).
tcf(c_0_14,plain,
! [X2: frac,X3: frac] :
( lessf(y,z)
| lessf(X2,z)
| ~ eq(X3,X2)
| ~ lessf(X3,y) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
tcf(c_0_15,plain,
! [X2: frac] : eq(X2,X2),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tcf(c_0_16,plain,
! [X2: frac,X3: frac,X4: frac] :
( lessf(X2,X4)
| ~ lessf(X2,X3)
| ~ lessf(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tcf(c_0_17,negated_conjecture,
~ lessf(x,z),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tcf(c_0_18,plain,
! [X2: frac] :
( lessf(X2,z)
| ~ lessf(X2,y) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
tcf(c_0_19,plain,
lessf(x,y),
inference(split_conjunct,[status(thm)],[l]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12 % Problem : NUM743_8 : TPTP v8.1.2. Released v8.0.0.
% 0.09/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n011.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 : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 14:14:38 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.46 Running first-order model finding
% 0.20/0.46 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.qkrko0UKmF/E---3.1_16118.p
% 0.20/0.48 # Version: 3.1pre001
% 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_3 with pid 16262 completed with status 0
% 0.20/0.48 # Result found by new_bool_3
% 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 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.48 # Search class: FGUNF-FFSF00-SFFFFFNN
% 0.20/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.48 # SAT001_MinMin_p005000_rr_RG with pid 16267 completed with status 0
% 0.20/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 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 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.48 # Search class: FGUNF-FFSF00-SFFFFFNN
% 0.20/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting SAT001_MinMin_p005000_rr_RG 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 : 13
% 0.20/0.48 # Removed by relevancy pruning/SinE : 7
% 0.20/0.48 # Initial clauses : 6
% 0.20/0.48 # Removed in clause preprocessing : 0
% 0.20/0.48 # Initial clauses in saturation : 6
% 0.20/0.48 # Processed clauses : 19
% 0.20/0.48 # ...of these trivial : 0
% 0.20/0.48 # ...subsumed : 0
% 0.20/0.48 # ...remaining for further processing : 19
% 0.20/0.48 # Other redundant clauses eliminated : 0
% 0.20/0.48 # Clauses deleted for lack of memory : 0
% 0.20/0.48 # Backward-subsumed : 1
% 0.20/0.48 # Backward-rewritten : 0
% 0.20/0.48 # Generated clauses : 13
% 0.20/0.48 # ...of the previous two non-redundant : 9
% 0.20/0.48 # ...aggressively subsumed : 0
% 0.20/0.48 # Contextual simplify-reflections : 1
% 0.20/0.48 # Paramodulations : 13
% 0.20/0.48 # Factorizations : 0
% 0.20/0.48 # NegExts : 0
% 0.20/0.48 # Equation resolutions : 0
% 0.20/0.48 # Total rewrite steps : 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 : 12
% 0.20/0.48 # Positive orientable unit clauses : 2
% 0.20/0.48 # Positive unorientable unit clauses: 0
% 0.20/0.48 # Negative unit clauses : 1
% 0.20/0.48 # Non-unit-clauses : 9
% 0.20/0.48 # Current number of unprocessed clauses: 2
% 0.20/0.48 # ...number of literals in the above : 8
% 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) : 26
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 25
% 0.20/0.48 # Non-unit clause-clause subsumptions : 2
% 0.20/0.48 # Unit Clause-clause subsumption calls : 1
% 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 : 0
% 0.20/0.48 # Condensation attempts : 0
% 0.20/0.48 # Condensation successes : 0
% 0.20/0.48 # Termbank termtop insertions : 519
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.005 s
% 0.20/0.48 # System time : 0.001 s
% 0.20/0.48 # Total time : 0.006 s
% 0.20/0.48 # Maximum resident set size: 1612 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.008 s
% 0.20/0.48 # System time : 0.001 s
% 0.20/0.48 # Total time : 0.009 s
% 0.20/0.48 # Maximum resident set size: 1696 pages
% 0.20/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------