TSTP Solution File: SYN371+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN371+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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 20:14:38 EDT 2023
% Result : Timeout 0.25s 300.11s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 6 ( 3 unt; 0 def)
% Number of atoms : 15 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 13 ( 4 ~; 1 |; 2 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 12 ( 0 sgn; 7 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(x2122,conjecture,
( ( ? [X1] : big_r(X1,X1)
=> ! [X2] : big_r(X2,X2) )
=> ? [X3] :
! [X4] :
( big_r(X3,X3)
=> big_r(X4,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.bjKuekaW6R/E---3.1_29542.p',x2122) ).
fof(c_0_1,negated_conjecture,
~ ( ( ? [X1] : big_r(X1,X1)
=> ! [X2] : big_r(X2,X2) )
=> ? [X3] :
! [X4] :
( big_r(X3,X3)
=> big_r(X4,X4) ) ),
inference(assume_negation,[status(cth)],[x2122]) ).
fof(c_0_2,negated_conjecture,
! [X5,X6,X7] :
( ( ~ big_r(X5,X5)
| big_r(X6,X6) )
& big_r(X7,X7)
& ~ big_r(esk1_0,esk1_0) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).
cnf(c_0_3,negated_conjecture,
~ big_r(esk1_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
big_r(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.09 % Problem : SYN371+1 : TPTP v8.1.2. Released v2.0.0.
% 0.09/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n024.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 18:20:26 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 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.bjKuekaW6R/E---3.1_29542.p
% 0.25/300.11 # Version: 3.1pre001
% 0.25/300.11 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.25/300.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/300.11 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.25/300.11 # Starting new_bool_3 with 300s (1) cores
% 0.25/300.11 # Starting new_bool_1 with 300s (1) cores
% 0.25/300.11 # Starting sh5l with 300s (1) cores
% 0.25/300.11 # new_bool_1 with pid 29626 completed with status 0
% 0.25/300.11 # Result found by new_bool_1
% 0.25/300.11 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.25/300.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/300.11 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.25/300.11 # Starting new_bool_3 with 300s (1) cores
% 0.25/300.11 # Starting new_bool_1 with 300s (1) cores
% 0.25/300.11 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/300.11 # Search class: FHUNF-FFSF00-SFFFFFNN
% 0.25/300.11 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/300.11 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.25/300.11 # SAT001_MinMin_p005000_rr_RG with pid 29631 completed with status 0
% 0.25/300.11 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.25/300.11 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.25/300.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/300.11 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.25/300.11 # Starting new_bool_3 with 300s (1) cores
% 0.25/300.11 # Starting new_bool_1 with 300s (1) cores
% 0.25/300.11 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/300.11 # Search class: FHUNF-FFSF00-SFFFFFNN
% 0.25/300.11 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/300.11 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.25/300.11 # Preprocessing time : 0.001 s
% 0.25/300.11 # Presaturation interreduction done
% 0.25/300.11
% 0.25/300.11 # Proof found!
% 0.25/300.11 # SZS status Theorem
% 0.25/300.11 # SZS output start CNFRefutation
% See solution above
% 0.25/300.11 # Parsed axioms : 1
% 0.25/300.11 # Removed by relevancy pruning/SinE : 0
% 0.25/300.11 # Initial clauses : 3
% 0.25/300.11 # Removed in clause preprocessing : 0
% 0.25/300.11 # Initial clauses in saturation : 3
% 0.25/300.11 # Processed clauses : 2
% 0.25/300.11 # ...of these trivial : 0
% 0.25/300.11 # ...subsumed : 0
% 0.25/300.11 # ...remaining for further processing : 2
% 0.25/300.11 # Other redundant clauses eliminated : 0
% 0.25/300.11 # Clauses deleted for lack of memory : 0
% 0.25/300.11 # Backward-subsumed : 0
% 0.25/300.11 # Backward-rewritten : 1
% 0.25/300.11 # Generated clauses : 0
% 0.25/300.11 # ...of the previous two non-redundant : 0
% 0.25/300.11 # ...aggressively subsumed : 0
% 0.25/300.11 # Contextual simplify-reflections : 0
% 0.25/300.11 # Paramodulations : 0
% 0.25/300.11 # Factorizations : 0
% 0.25/300.11 # NegExts : 0
% 0.25/300.11 # Equation resolutions : 0
% 0.25/300.11 # Total rewrite steps : 1
% 0.25/300.11 # Propositional unsat checks : 0
% 0.25/300.11 # Propositional check models : 0
% 0.25/300.11 # Propositional check unsatisfiable : 0
% 0.25/300.11 # Propositional clauses : 0
% 0.25/300.11 # Propositional clauses after purity: 0
% 0.25/300.11 # Propositional unsat core size : 0
% 0.25/300.11 # Propositional preprocessing time : 0.000
% 0.25/300.11 # Propositional encoding time : 0.000
% 0.25/300.11 # Propositional solver time : 0.000
% 0.25/300.11 # Success case prop preproc time : 0.000
% 0.25/300.11 # Success case prop encoding time : 0.000
% 0.25/300.11 # Success case prop solver time : 0.000
% 0.25/300.11 # Current number of processed clauses : 1
% 0.25/300.11 # Positive orientable unit clauses : 1
% 0.25/300.11 # Positive unorientable unit clauses: 0
% 0.25/300.11 # Negative unit clauses : 0
% 0.25/300.11 # Non-unit-clauses : 0
% 0.25/300.11 # Current number of unprocessed clauses: 1
% 0.25/300.11 # ...number of literals in the above : 2
% 0.25/300.11 # Current number of archived formulas : 0
% 0.25/300.11 # Current number of archived clauses : 1
% 0.25/300.11 # Clause-clause subsumption calls (NU) : 0
% 0.25/300.11 # Rec. Clause-clause subsumption calls : 0
% 0.25/300.11 # Non-unit clause-clause subsumptions : 0
% 0.25/300.11 # Unit Clause-clause subsumption calls : 0
% 0.25/300.11 # Rewrite failures with RHS unbound : 0
% 0.25/300.11 # BW rewrite match attempts : 1
% 0.25/300.11 # BW rewrite match successes : 1
% 0.25/300.11 # Condensation attempts : 0
% 0.25/300.11 # Condensation successes : 0
% 0.25/300.11 # Termbank termtop insertions : 158
% 0.25/300.11
% 0.25/300.11 # -------------------------------------------------
% 0.25/300.11 # User time : 0.002 s
% 0.25/300.11 # System time : 0.000 s
% 0.25/300.11 # Total time : 0.002 s
% 0.25/300.11 # Maximum resident set size: 1588 pages
% 0.25/300.11
% 0.25/300.11 # -------------------------------------------------
% 0.25/300.11 # User time : 0.003 s
% 0.25/300.11 # System time : 0.002 s
% 0.25/300.11 # Total time : 0.005 s
% 0.25/300.11 # Maximum resident set size: 1668 pages
% 0.25/300.11 % E---3.1 exiting
% 0.25/300.12 % E---3.1 exiting
%------------------------------------------------------------------------------