TSTP Solution File: SWW302+1 by E-SAT---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.2.0
% Problem : SWW302+1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d SAT
% Computer : n029.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 : Mon Jun 24 18:14:07 EDT 2024
% Result : Theorem 1.07s 1.38s
% Output : CNFRefutation 1.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 3 unt; 0 def)
% Number of atoms : 25 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 22 ( 8 ~; 5 |; 2 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 17 ( 0 sgn 13 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_1,conjecture,
! [X282,X283] :
( v_P(X282,X283)
=> ! [X284] :
( ! [X285] :
( v_P(X285,X283)
=> v_Q_H(X285,X284) )
=> v_Q(X282,X284) ) ),
file('/export/starexec/sandbox/tmp/tmp.7R4QayeY1K/E---3.1_26290.p',conj_1) ).
fof(conj_0,hypothesis,
! [X282,X283] :
( v_Q_H(X282,X283)
=> v_Q(X282,X283) ),
file('/export/starexec/sandbox/tmp/tmp.7R4QayeY1K/E---3.1_26290.p',conj_0) ).
fof(c_0_2,negated_conjecture,
~ ! [X282,X283] :
( v_P(X282,X283)
=> ! [X284] :
( ! [X285] :
( v_P(X285,X283)
=> v_Q_H(X285,X284) )
=> v_Q(X282,X284) ) ),
inference(assume_negation,[status(cth)],[conj_1]) ).
fof(c_0_3,hypothesis,
! [X290,X291] :
( ~ v_Q_H(X290,X291)
| v_Q(X290,X291) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_0])])]) ).
fof(c_0_4,negated_conjecture,
! [X289] :
( v_P(esk1_0,esk2_0)
& ( ~ v_P(X289,esk2_0)
| v_Q_H(X289,esk3_0) )
& ~ v_Q(esk1_0,esk3_0) ),
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_2])])])])]) ).
cnf(c_0_5,hypothesis,
( v_Q(X1,X2)
| ~ v_Q_H(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
( v_Q_H(X1,esk3_0)
| ~ v_P(X1,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
~ v_Q(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
( v_Q(X1,esk3_0)
| ~ v_P(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,negated_conjecture,
v_P(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWW302+1 : TPTP v8.2.0. Released v5.2.0.
% 0.03/0.12 % Command : run_E %s %d SAT
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jun 19 04:55:54 EDT 2024
% 0.12/0.33 % CPUTime :
% 1.05/1.21 Running first-order model finding
% 1.05/1.21 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.7R4QayeY1K/E---3.1_26290.p
% 1.07/1.38 # Version: 3.2.0
% 1.07/1.38 # Preprocessing class: FMLMSMSMSSSNFFN.
% 1.07/1.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.07/1.38 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.07/1.38 # Starting new_bool_3 with 300s (1) cores
% 1.07/1.38 # Starting new_bool_1 with 300s (1) cores
% 1.07/1.38 # Starting sh5l with 300s (1) cores
% 1.07/1.38 # sh5l with pid 26371 completed with status 0
% 1.07/1.38 # Result found by sh5l
% 1.07/1.38 # Preprocessing class: FMLMSMSMSSSNFFN.
% 1.07/1.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.07/1.38 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.07/1.38 # Starting new_bool_3 with 300s (1) cores
% 1.07/1.38 # Starting new_bool_1 with 300s (1) cores
% 1.07/1.38 # Starting sh5l with 300s (1) cores
% 1.07/1.38 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.07/1.38 # Search class: FHUNF-FFSF00-SFFFFFNN
% 1.07/1.38 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.07/1.38 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.07/1.38 # SAT001_MinMin_p005000_rr_RG with pid 26373 completed with status 0
% 1.07/1.38 # Result found by SAT001_MinMin_p005000_rr_RG
% 1.07/1.38 # Preprocessing class: FMLMSMSMSSSNFFN.
% 1.07/1.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.07/1.38 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.07/1.38 # Starting new_bool_3 with 300s (1) cores
% 1.07/1.38 # Starting new_bool_1 with 300s (1) cores
% 1.07/1.38 # Starting sh5l with 300s (1) cores
% 1.07/1.38 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.07/1.38 # Search class: FHUNF-FFSF00-SFFFFFNN
% 1.07/1.38 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.07/1.38 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.07/1.38 # Preprocessing time : 0.004 s
% 1.07/1.38 # Presaturation interreduction done
% 1.07/1.38
% 1.07/1.38 # Proof found!
% 1.07/1.38 # SZS status Theorem
% 1.07/1.38 # SZS output start CNFRefutation
% See solution above
% 1.07/1.38 # Parsed axioms : 5242
% 1.07/1.38 # Removed by relevancy pruning/SinE : 5240
% 1.07/1.38 # Initial clauses : 4
% 1.07/1.38 # Removed in clause preprocessing : 0
% 1.07/1.38 # Initial clauses in saturation : 4
% 1.07/1.38 # Processed clauses : 9
% 1.07/1.38 # ...of these trivial : 0
% 1.07/1.38 # ...subsumed : 0
% 1.07/1.38 # ...remaining for further processing : 9
% 1.07/1.38 # Other redundant clauses eliminated : 0
% 1.07/1.38 # Clauses deleted for lack of memory : 0
% 1.07/1.38 # Backward-subsumed : 0
% 1.07/1.38 # Backward-rewritten : 0
% 1.07/1.38 # Generated clauses : 2
% 1.07/1.38 # ...of the previous two non-redundant : 1
% 1.07/1.38 # ...aggressively subsumed : 0
% 1.07/1.38 # Contextual simplify-reflections : 0
% 1.07/1.38 # Paramodulations : 2
% 1.07/1.38 # Factorizations : 0
% 1.07/1.38 # NegExts : 0
% 1.07/1.38 # Equation resolutions : 0
% 1.07/1.38 # Disequality decompositions : 0
% 1.07/1.38 # Total rewrite steps : 1
% 1.07/1.38 # ...of those cached : 0
% 1.07/1.38 # Propositional unsat checks : 0
% 1.07/1.38 # Propositional check models : 0
% 1.07/1.38 # Propositional check unsatisfiable : 0
% 1.07/1.38 # Propositional clauses : 0
% 1.07/1.38 # Propositional clauses after purity: 0
% 1.07/1.38 # Propositional unsat core size : 0
% 1.07/1.38 # Propositional preprocessing time : 0.000
% 1.07/1.38 # Propositional encoding time : 0.000
% 1.07/1.38 # Propositional solver time : 0.000
% 1.07/1.38 # Success case prop preproc time : 0.000
% 1.07/1.38 # Success case prop encoding time : 0.000
% 1.07/1.38 # Success case prop solver time : 0.000
% 1.07/1.38 # Current number of processed clauses : 5
% 1.07/1.38 # Positive orientable unit clauses : 1
% 1.07/1.38 # Positive unorientable unit clauses: 0
% 1.07/1.38 # Negative unit clauses : 1
% 1.07/1.38 # Non-unit-clauses : 3
% 1.07/1.38 # Current number of unprocessed clauses: 0
% 1.07/1.38 # ...number of literals in the above : 0
% 1.07/1.38 # Current number of archived formulas : 0
% 1.07/1.38 # Current number of archived clauses : 4
% 1.07/1.38 # Clause-clause subsumption calls (NU) : 0
% 1.07/1.38 # Rec. Clause-clause subsumption calls : 0
% 1.07/1.38 # Non-unit clause-clause subsumptions : 0
% 1.07/1.38 # Unit Clause-clause subsumption calls : 0
% 1.07/1.38 # Rewrite failures with RHS unbound : 0
% 1.07/1.38 # BW rewrite match attempts : 0
% 1.07/1.38 # BW rewrite match successes : 0
% 1.07/1.38 # Condensation attempts : 0
% 1.07/1.38 # Condensation successes : 0
% 1.07/1.38 # Termbank termtop insertions : 130384
% 1.07/1.38 # Search garbage collected termcells : 50209
% 1.07/1.38
% 1.07/1.38 # -------------------------------------------------
% 1.07/1.38 # User time : 0.033 s
% 1.07/1.38 # System time : 0.015 s
% 1.07/1.38 # Total time : 0.049 s
% 1.07/1.38 # Maximum resident set size: 10616 pages
% 1.07/1.38
% 1.07/1.38 # -------------------------------------------------
% 1.07/1.38 # User time : 0.137 s
% 1.07/1.38 # System time : 0.019 s
% 1.07/1.38 # Total time : 0.156 s
% 1.07/1.38 # Maximum resident set size: 9468 pages
% 1.07/1.38 % E---3.1 exiting
% 1.07/1.38 % E exiting
%------------------------------------------------------------------------------