TSTP Solution File: NUN089+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUN089+2 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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 09:08:42 EDT 2024
% Result : Theorem 0.22s 0.53s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 14 ( 6 unt; 0 def)
% Number of atoms : 35 ( 8 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 47 ( 26 ~; 17 |; 4 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 22 ( 2 sgn 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_7a,axiom,
! [X41,X42] :
( ! [X43] :
( ~ r1(X43)
| X43 != X42 )
| ~ r2(X41,X42) ),
file('/export/starexec/sandbox/tmp/tmp.nqZktFaCxw/E---3.1_10753.p',axiom_7a) ).
fof(zerouneqtwo,conjecture,
! [X39] :
( ! [X22] :
( ! [X23] :
( ~ r1(X23)
| ~ r2(X23,X22) )
| ~ r2(X22,X39) )
| ! [X16] :
( X16 != X39
| ~ r1(X16) ) ),
file('/export/starexec/sandbox/tmp/tmp.nqZktFaCxw/E---3.1_10753.p',zerouneqtwo) ).
fof(c_0_2,plain,
! [X41,X42] :
( ! [X43] :
( ~ r1(X43)
| X43 != X42 )
| ~ r2(X41,X42) ),
inference(fof_simplification,[status(thm)],[axiom_7a]) ).
fof(c_0_3,negated_conjecture,
~ ! [X39] :
( ! [X22] :
( ! [X23] :
( ~ r1(X23)
| ~ r2(X23,X22) )
| ~ r2(X22,X39) )
| ! [X16] :
( X16 != X39
| ~ r1(X16) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[zerouneqtwo])]) ).
fof(c_0_4,plain,
! [X84,X85,X86] :
( ~ r1(X86)
| X86 != X85
| ~ r2(X84,X85) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_2])])]) ).
fof(c_0_5,negated_conjecture,
( r1(esk23_0)
& r2(esk23_0,esk22_0)
& r2(esk22_0,esk21_0)
& esk24_0 = esk21_0
& r1(esk24_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_6,plain,
( ~ r1(X1)
| X1 != X2
| ~ r2(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
r1(esk24_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
esk24_0 = esk21_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ r2(X1,X2)
| ~ r1(X2) ),
inference(er,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
r2(esk22_0,esk21_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
r1(esk21_0),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
~ r1(esk21_0),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_11,c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUN089+2 : TPTP v8.1.2. Released v7.3.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n004.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 11:53:33 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.51 Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.nqZktFaCxw/E---3.1_10753.p
% 0.22/0.53 # Version: 3.1.0
% 0.22/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 10844 completed with status 0
% 0.22/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.53 # No SInE strategy applied
% 0.22/0.53 # Search class: FGHSM-FFSS21-SFFFFFNN
% 0.22/0.53 # partial match(1): FGHSF-FFSS21-SFFFFFNN
% 0.22/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.53 # Starting new_bool_3 with 136s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 136s (1) cores
% 0.22/0.53 # Starting sh5l with 136s (1) cores
% 0.22/0.53 # SAT001_MinMin_p005000_rr_RG with pid 10848 completed with status 0
% 0.22/0.53 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.53 # No SInE strategy applied
% 0.22/0.53 # Search class: FGHSM-FFSS21-SFFFFFNN
% 0.22/0.53 # partial match(1): FGHSF-FFSS21-SFFFFFNN
% 0.22/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.53 # Preprocessing time : 0.002 s
% 0.22/0.53 # Presaturation interreduction done
% 0.22/0.53
% 0.22/0.53 # Proof found!
% 0.22/0.53 # SZS status Theorem
% 0.22/0.53 # SZS output start CNFRefutation
% See solution above
% 0.22/0.53 # Parsed axioms : 12
% 0.22/0.53 # Removed by relevancy pruning/SinE : 0
% 0.22/0.53 # Initial clauses : 44
% 0.22/0.53 # Removed in clause preprocessing : 12
% 0.22/0.53 # Initial clauses in saturation : 32
% 0.22/0.53 # Processed clauses : 47
% 0.22/0.53 # ...of these trivial : 0
% 0.22/0.53 # ...subsumed : 0
% 0.22/0.53 # ...remaining for further processing : 46
% 0.22/0.53 # Other redundant clauses eliminated : 6
% 0.22/0.53 # Clauses deleted for lack of memory : 0
% 0.22/0.53 # Backward-subsumed : 0
% 0.22/0.53 # Backward-rewritten : 0
% 0.22/0.53 # Generated clauses : 9
% 0.22/0.53 # ...of the previous two non-redundant : 9
% 0.22/0.53 # ...aggressively subsumed : 0
% 0.22/0.53 # Contextual simplify-reflections : 0
% 0.22/0.53 # Paramodulations : 3
% 0.22/0.53 # Factorizations : 0
% 0.22/0.53 # NegExts : 0
% 0.22/0.53 # Equation resolutions : 6
% 0.22/0.53 # Disequality decompositions : 0
% 0.22/0.53 # Total rewrite steps : 1
% 0.22/0.53 # ...of those cached : 0
% 0.22/0.53 # Propositional unsat checks : 0
% 0.22/0.53 # Propositional check models : 0
% 0.22/0.53 # Propositional check unsatisfiable : 0
% 0.22/0.53 # Propositional clauses : 0
% 0.22/0.53 # Propositional clauses after purity: 0
% 0.22/0.53 # Propositional unsat core size : 0
% 0.22/0.53 # Propositional preprocessing time : 0.000
% 0.22/0.53 # Propositional encoding time : 0.000
% 0.22/0.53 # Propositional solver time : 0.000
% 0.22/0.53 # Success case prop preproc time : 0.000
% 0.22/0.53 # Success case prop encoding time : 0.000
% 0.22/0.53 # Success case prop solver time : 0.000
% 0.22/0.53 # Current number of processed clauses : 8
% 0.22/0.53 # Positive orientable unit clauses : 5
% 0.22/0.53 # Positive unorientable unit clauses: 0
% 0.22/0.53 # Negative unit clauses : 1
% 0.22/0.53 # Non-unit-clauses : 2
% 0.22/0.53 # Current number of unprocessed clauses: 26
% 0.22/0.53 # ...number of literals in the above : 35
% 0.22/0.53 # Current number of archived formulas : 0
% 0.22/0.53 # Current number of archived clauses : 36
% 0.22/0.53 # Clause-clause subsumption calls (NU) : 12
% 0.22/0.53 # Rec. Clause-clause subsumption calls : 9
% 0.22/0.53 # Non-unit clause-clause subsumptions : 0
% 0.22/0.53 # Unit Clause-clause subsumption calls : 2
% 0.22/0.53 # Rewrite failures with RHS unbound : 0
% 0.22/0.53 # BW rewrite match attempts : 6
% 0.22/0.53 # BW rewrite match successes : 0
% 0.22/0.53 # Condensation attempts : 0
% 0.22/0.53 # Condensation successes : 0
% 0.22/0.53 # Termbank termtop insertions : 1486
% 0.22/0.53 # Search garbage collected termcells : 302
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.010 s
% 0.22/0.53 # System time : 0.002 s
% 0.22/0.53 # Total time : 0.012 s
% 0.22/0.53 # Maximum resident set size: 1836 pages
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.031 s
% 0.22/0.53 # System time : 0.009 s
% 0.22/0.53 # Total time : 0.040 s
% 0.22/0.53 # Maximum resident set size: 1732 pages
% 0.22/0.53 % E---3.1 exiting
% 0.22/0.53 % E exiting
%------------------------------------------------------------------------------