TSTP Solution File: SYN926+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYN926+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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 10:30:09 EDT 2024
% Result : Theorem 0.20s 0.54s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 1
% Syntax : Number of formulae : 8 ( 4 unt; 0 def)
% Number of atoms : 18 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 16 ( 6 ~; 2 |; 6 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 11 ( 3 sgn 2 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
( ? [X1] :
( p(X1)
& q(X1) )
=> ( ? [X1] : p(X1)
& ? [X1] : q(X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.n0e2Bock3R/E---3.1_22380.p',prove_this) ).
fof(c_0_1,negated_conjecture,
~ ( ? [X1] :
( p(X1)
& q(X1) )
=> ( ? [X1] : p(X1)
& ? [X1] : q(X1) ) ),
inference(assume_negation,[status(cth)],[prove_this]) ).
fof(c_0_2,negated_conjecture,
! [X3,X4] :
( p(esk1_0)
& q(esk1_0)
& ( ~ p(X3)
| ~ q(X4) ) ),
inference(fof_nnf,[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,
( ~ p(X1)
| ~ q(X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
q(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
p(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
~ p(X1),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_5,c_0_6]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.16 % Problem : SYN926+1 : TPTP v8.1.2. Released v3.1.0.
% 0.14/0.18 % Command : run_E %s %d THM
% 0.14/0.39 % Computer : n005.cluster.edu
% 0.14/0.39 % Model : x86_64 x86_64
% 0.14/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.39 % Memory : 8042.1875MB
% 0.14/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.39 % CPULimit : 300
% 0.14/0.39 % WCLimit : 300
% 0.14/0.39 % DateTime : Fri May 3 10:43:26 EDT 2024
% 0.14/0.39 % CPUTime :
% 0.20/0.53 Running first-order model finding
% 0.20/0.53 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.n0e2Bock3R/E---3.1_22380.p
% 0.20/0.54 # Version: 3.1.0
% 0.20/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.54 # Starting sh5l with 300s (1) cores
% 0.20/0.54 # new_bool_3 with pid 22458 completed with status 0
% 0.20/0.54 # Result found by new_bool_3
% 0.20/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.54 # Search class: FUHNF-FFSF00-SFFFFFNN
% 0.20/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.54 # SAT001_MinMin_p005000_rr_RG with pid 22462 completed with status 0
% 0.20/0.54 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.54 # Search class: FUHNF-FFSF00-SFFFFFNN
% 0.20/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.54 # Preprocessing time : 0.001 s
% 0.20/0.54 # Presaturation interreduction done
% 0.20/0.54
% 0.20/0.54 # Proof found!
% 0.20/0.54 # SZS status Theorem
% 0.20/0.54 # SZS output start CNFRefutation
% See solution above
% 0.20/0.54 # Parsed axioms : 1
% 0.20/0.54 # Removed by relevancy pruning/SinE : 0
% 0.20/0.54 # Initial clauses : 3
% 0.20/0.54 # Removed in clause preprocessing : 0
% 0.20/0.54 # Initial clauses in saturation : 3
% 0.20/0.54 # Processed clauses : 7
% 0.20/0.54 # ...of these trivial : 0
% 0.20/0.54 # ...subsumed : 0
% 0.20/0.54 # ...remaining for further processing : 7
% 0.20/0.54 # Other redundant clauses eliminated : 0
% 0.20/0.54 # Clauses deleted for lack of memory : 0
% 0.20/0.54 # Backward-subsumed : 1
% 0.20/0.54 # Backward-rewritten : 0
% 0.20/0.54 # Generated clauses : 2
% 0.20/0.54 # ...of the previous two non-redundant : 1
% 0.20/0.54 # ...aggressively subsumed : 0
% 0.20/0.54 # Contextual simplify-reflections : 0
% 0.20/0.54 # Paramodulations : 1
% 0.20/0.54 # Factorizations : 0
% 0.20/0.54 # NegExts : 0
% 0.20/0.54 # Equation resolutions : 0
% 0.20/0.54 # Disequality decompositions : 0
% 0.20/0.54 # Total rewrite steps : 0
% 0.20/0.54 # ...of those cached : 0
% 0.20/0.54 # Propositional unsat checks : 0
% 0.20/0.54 # Propositional check models : 0
% 0.20/0.54 # Propositional check unsatisfiable : 0
% 0.20/0.54 # Propositional clauses : 0
% 0.20/0.54 # Propositional clauses after purity: 0
% 0.20/0.54 # Propositional unsat core size : 0
% 0.20/0.54 # Propositional preprocessing time : 0.000
% 0.20/0.54 # Propositional encoding time : 0.000
% 0.20/0.54 # Propositional solver time : 0.000
% 0.20/0.54 # Success case prop preproc time : 0.000
% 0.20/0.54 # Success case prop encoding time : 0.000
% 0.20/0.54 # Success case prop solver time : 0.000
% 0.20/0.54 # Current number of processed clauses : 2
% 0.20/0.54 # Positive orientable unit clauses : 1
% 0.20/0.54 # Positive unorientable unit clauses: 0
% 0.20/0.54 # Negative unit clauses : 1
% 0.20/0.54 # Non-unit-clauses : 0
% 0.20/0.54 # Current number of unprocessed clauses: 0
% 0.20/0.54 # ...number of literals in the above : 0
% 0.20/0.54 # Current number of archived formulas : 0
% 0.20/0.54 # Current number of archived clauses : 5
% 0.20/0.54 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.54 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.54 # Non-unit clause-clause subsumptions : 0
% 0.20/0.54 # Unit Clause-clause subsumption calls : 1
% 0.20/0.54 # Rewrite failures with RHS unbound : 0
% 0.20/0.54 # BW rewrite match attempts : 0
% 0.20/0.54 # BW rewrite match successes : 0
% 0.20/0.54 # Condensation attempts : 0
% 0.20/0.54 # Condensation successes : 0
% 0.20/0.54 # Termbank termtop insertions : 156
% 0.20/0.54 # Search garbage collected termcells : 48
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.000 s
% 0.20/0.54 # System time : 0.004 s
% 0.20/0.54 # Total time : 0.004 s
% 0.20/0.54 # Maximum resident set size: 1612 pages
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.000 s
% 0.20/0.54 # System time : 0.007 s
% 0.20/0.54 # Total time : 0.007 s
% 0.20/0.54 # Maximum resident set size: 1680 pages
% 0.20/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------