TSTP Solution File: NUM304+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM304+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 : Sat May 4 08:59:17 EDT 2024
% Result : Theorem 0.22s 0.55s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 12 unt; 0 def)
% Number of atoms : 39 ( 10 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 39 ( 20 ~; 11 |; 5 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-1 aty)
% Number of variables : 32 ( 8 sgn 15 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(something_not_n12,conjecture,
? [X1] : X1 != n12,
file('/export/starexec/sandbox/tmp/tmp.LkQYXVrk0v/E---3.1_29596.p',something_not_n12) ).
fof(less_property,axiom,
! [X1,X2] :
( less(X1,X2)
<=> ( ~ less(X2,X1)
& X2 != X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.LkQYXVrk0v/E---3.1_29596.p',less_property) ).
fof(less_entry_point_neg_pos,axiom,
! [X1,X2,X10,X11] :
( ( rdn_translate(X1,rdn_neg(X10))
& rdn_translate(X2,rdn_pos(X11)) )
=> less(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.LkQYXVrk0v/E---3.1_29596.p',less_entry_point_neg_pos) ).
fof(rdn1,axiom,
rdn_translate(n1,rdn_pos(rdnn(n1))),
file('/export/starexec/sandbox/tmp/tmp.LkQYXVrk0v/E---3.1_29596.p',rdn1) ).
fof(c_0_4,negated_conjecture,
~ ? [X1] : X1 != n12,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[something_not_n12])]) ).
fof(c_0_5,negated_conjecture,
! [X154] : X154 = n12,
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).
fof(c_0_6,plain,
! [X1,X2] :
( less(X1,X2)
<=> ( ~ less(X2,X1)
& X2 != X1 ) ),
inference(fof_simplification,[status(thm)],[less_property]) ).
fof(c_0_7,plain,
! [X53,X54,X55,X56] :
( ~ rdn_translate(X53,rdn_neg(X55))
| ~ rdn_translate(X54,rdn_pos(X56))
| less(X53,X54) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_entry_point_neg_pos])])]) ).
cnf(c_0_8,plain,
rdn_translate(n1,rdn_pos(rdnn(n1))),
inference(split_conjunct,[status(thm)],[rdn1]) ).
cnf(c_0_9,negated_conjecture,
X1 = n12,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_10,plain,
! [X61,X62] :
( ( ~ less(X62,X61)
| ~ less(X61,X62) )
& ( X62 != X61
| ~ less(X61,X62) )
& ( less(X62,X61)
| X62 = X61
| less(X61,X62) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
cnf(c_0_11,plain,
( less(X1,X3)
| ~ rdn_translate(X1,rdn_neg(X2))
| ~ rdn_translate(X3,rdn_pos(X4)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
rdn_translate(n1,n12),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_9]) ).
cnf(c_0_13,negated_conjecture,
X1 = X2,
inference(spm,[status(thm)],[c_0_9,c_0_9]) ).
cnf(c_0_14,plain,
( X1 != X2
| ~ less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( less(X1,X2)
| ~ rdn_translate(X2,n12)
| ~ rdn_translate(X1,n12) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_9]),c_0_9]) ).
cnf(c_0_16,negated_conjecture,
rdn_translate(X1,n12),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
~ less(X1,X1),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
less(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16])]) ).
cnf(c_0_19,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.13 % Problem : NUM304+1 : TPTP v8.1.2. Released v3.1.0.
% 0.09/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n029.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 09:33:22 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.51 Running first-order model finding
% 0.22/0.51 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/tmp/tmp.LkQYXVrk0v/E---3.1_29596.p
% 0.22/0.55 # Version: 3.1.0
% 0.22/0.55 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.22/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.22/0.55 # Starting new_bool_3 with 600s (2) cores
% 0.22/0.55 # Starting new_bool_1 with 600s (2) cores
% 0.22/0.55 # Starting sh5l with 300s (1) cores
% 0.22/0.55 # G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 29715 completed with status 0
% 0.22/0.55 # Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 0.22/0.55 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.22/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.22/0.55 # No SInE strategy applied
% 0.22/0.55 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.22/0.55 # Scheduled 11 strats onto 3 cores with 900 seconds (900 total)
% 0.22/0.55 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 82s (1) cores
% 0.22/0.55 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 91s (1) cores
% 0.22/0.55 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 82s (1) cores
% 0.22/0.55 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 29731 completed with status 0
% 0.22/0.55 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 0.22/0.55 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.22/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.22/0.55 # No SInE strategy applied
% 0.22/0.55 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.22/0.55 # Scheduled 11 strats onto 3 cores with 900 seconds (900 total)
% 0.22/0.55 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 82s (1) cores
% 0.22/0.55 # Preprocessing time : 0.005 s
% 0.22/0.55 # Presaturation interreduction done
% 0.22/0.55
% 0.22/0.55 # Proof found!
% 0.22/0.55 # SZS status Theorem
% 0.22/0.55 # SZS output start CNFRefutation
% See solution above
% 0.22/0.55 # Parsed axioms : 402
% 0.22/0.55 # Removed by relevancy pruning/SinE : 0
% 0.22/0.55 # Initial clauses : 407
% 0.22/0.55 # Removed in clause preprocessing : 0
% 0.22/0.55 # Initial clauses in saturation : 407
% 0.22/0.55 # Processed clauses : 449
% 0.22/0.55 # ...of these trivial : 369
% 0.22/0.55 # ...subsumed : 11
% 0.22/0.55 # ...remaining for further processing : 69
% 0.22/0.55 # Other redundant clauses eliminated : 2
% 0.22/0.55 # Clauses deleted for lack of memory : 0
% 0.22/0.55 # Backward-subsumed : 1
% 0.22/0.55 # Backward-rewritten : 22
% 0.22/0.55 # Generated clauses : 93
% 0.22/0.55 # ...of the previous two non-redundant : 94
% 0.22/0.55 # ...aggressively subsumed : 0
% 0.22/0.55 # Contextual simplify-reflections : 0
% 0.22/0.55 # Paramodulations : 91
% 0.22/0.55 # Factorizations : 0
% 0.22/0.55 # NegExts : 0
% 0.22/0.55 # Equation resolutions : 2
% 0.22/0.55 # Disequality decompositions : 0
% 0.22/0.55 # Total rewrite steps : 2308
% 0.22/0.55 # ...of those cached : 1999
% 0.22/0.55 # Propositional unsat checks : 0
% 0.22/0.55 # Propositional check models : 0
% 0.22/0.55 # Propositional check unsatisfiable : 0
% 0.22/0.55 # Propositional clauses : 0
% 0.22/0.55 # Propositional clauses after purity: 0
% 0.22/0.55 # Propositional unsat core size : 0
% 0.22/0.55 # Propositional preprocessing time : 0.000
% 0.22/0.55 # Propositional encoding time : 0.000
% 0.22/0.55 # Propositional solver time : 0.000
% 0.22/0.55 # Success case prop preproc time : 0.000
% 0.22/0.55 # Success case prop encoding time : 0.000
% 0.22/0.55 # Success case prop solver time : 0.000
% 0.22/0.55 # Current number of processed clauses : 11
% 0.22/0.55 # Positive orientable unit clauses : 8
% 0.22/0.55 # Positive unorientable unit clauses: 1
% 0.22/0.55 # Negative unit clauses : 0
% 0.22/0.55 # Non-unit-clauses : 2
% 0.22/0.55 # Current number of unprocessed clauses: 72
% 0.22/0.55 # ...number of literals in the above : 100
% 0.22/0.55 # Current number of archived formulas : 0
% 0.22/0.55 # Current number of archived clauses : 56
% 0.22/0.55 # Clause-clause subsumption calls (NU) : 237
% 0.22/0.55 # Rec. Clause-clause subsumption calls : 129
% 0.22/0.55 # Non-unit clause-clause subsumptions : 5
% 0.22/0.55 # Unit Clause-clause subsumption calls : 26
% 0.22/0.55 # Rewrite failures with RHS unbound : 50
% 0.22/0.55 # BW rewrite match attempts : 36
% 0.22/0.55 # BW rewrite match successes : 25
% 0.22/0.55 # Condensation attempts : 0
% 0.22/0.55 # Condensation successes : 0
% 0.22/0.55 # Termbank termtop insertions : 19806
% 0.22/0.55 # Search garbage collected termcells : 765
% 0.22/0.55
% 0.22/0.55 # -------------------------------------------------
% 0.22/0.55 # User time : 0.014 s
% 0.22/0.55 # System time : 0.006 s
% 0.22/0.55 # Total time : 0.021 s
% 0.22/0.55 # Maximum resident set size: 2588 pages
% 0.22/0.55
% 0.22/0.55 # -------------------------------------------------
% 0.22/0.55 # User time : 0.031 s
% 0.22/0.55 # System time : 0.018 s
% 0.22/0.55 # Total time : 0.049 s
% 0.22/0.55 # Maximum resident set size: 2052 pages
% 0.22/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------