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