TSTP Solution File: SYN957+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN957+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:27:38 EDT 2023
% Result : Theorem 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 1
% Syntax : Number of formulae : 7 ( 2 unt; 0 def)
% Number of atoms : 14 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 16 ( 9 ~; 4 |; 1 &)
% ( 2 <=>; 0 =>; 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 : 7 ( 0 sgn; 3 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
~ ? [X1] :
! [X2] :
( a(X2,X1)
<=> ~ a(X2,X2) ),
file('/export/starexec/sandbox/tmp/tmp.8yWSspGIKi/E---3.1_27291.p',prove_this) ).
fof(c_0_1,negated_conjecture,
~ ~ ? [X1] :
! [X2] :
( a(X2,X1)
<=> ~ a(X2,X2) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_this])]) ).
fof(c_0_2,negated_conjecture,
! [X4] :
( ( ~ a(X4,esk1_0)
| ~ a(X4,X4) )
& ( a(X4,X4)
| a(X4,esk1_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])]) ).
cnf(c_0_3,negated_conjecture,
( a(X1,X1)
| a(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( ~ a(X1,esk1_0)
| ~ a(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
a(esk1_0,esk1_0),
inference(ef,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_5])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN957+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n023.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 18:38:37 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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.8yWSspGIKi/E---3.1_27291.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 27370 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: FGHNF-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 27374 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: FGHNF-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 : 1
% 0.20/0.48 # Removed by relevancy pruning/SinE : 0
% 0.20/0.48 # Initial clauses : 2
% 0.20/0.48 # Removed in clause preprocessing : 0
% 0.20/0.48 # Initial clauses in saturation : 2
% 0.20/0.48 # Processed clauses : 5
% 0.20/0.48 # ...of these trivial : 0
% 0.20/0.48 # ...subsumed : 0
% 0.20/0.48 # ...remaining for further processing : 5
% 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 : 0
% 0.20/0.48 # Backward-rewritten : 0
% 0.20/0.48 # Generated clauses : 4
% 0.20/0.48 # ...of the previous two non-redundant : 2
% 0.20/0.48 # ...aggressively subsumed : 0
% 0.20/0.48 # Contextual simplify-reflections : 0
% 0.20/0.48 # Paramodulations : 2
% 0.20/0.48 # Factorizations : 2
% 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 : 3
% 0.20/0.48 # Positive orientable unit clauses : 1
% 0.20/0.48 # Positive unorientable unit clauses: 0
% 0.20/0.48 # Negative unit clauses : 0
% 0.20/0.48 # Non-unit-clauses : 2
% 0.20/0.48 # Current number of unprocessed clauses: 1
% 0.20/0.48 # ...number of literals in the above : 1
% 0.20/0.48 # Current number of archived formulas : 0
% 0.20/0.48 # Current number of archived clauses : 2
% 0.20/0.48 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.48 # Non-unit clause-clause subsumptions : 0
% 0.20/0.48 # Unit Clause-clause subsumption calls : 0
% 0.20/0.48 # Rewrite failures with RHS unbound : 0
% 0.20/0.48 # BW rewrite match attempts : 0
% 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 : 139
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.004 s
% 0.20/0.48 # System time : 0.000 s
% 0.20/0.48 # Total time : 0.004 s
% 0.20/0.48 # Maximum resident set size: 1596 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.004 s
% 0.20/0.48 # System time : 0.003 s
% 0.20/0.48 # Total time : 0.007 s
% 0.20/0.48 # Maximum resident set size: 1668 pages
% 0.20/0.48 % E---3.1 exiting
% 0.20/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------