TSTP Solution File: SWV414+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWV414+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 19:44:35 EDT 2023
% Result : Timeout 408.17s 300.19s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 8 ( 8 unt; 0 def)
% Number of atoms : 8 ( 7 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-3 aty)
% Number of variables : 8 ( 2 sgn; 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] : i(triple(create_pqp,create_slb,X1)) = create_pq,
file('/export/starexec/sandbox2/tmp/tmp.ncKUcVYOqj/E---3.1_20894.p',co1) ).
fof(ax54,axiom,
! [X1,X2] : i(triple(X1,create_slb,X2)) = create_pq,
file('/export/starexec/sandbox2/tmp/tmp.ncKUcVYOqj/E---3.1_20894.p',ax54) ).
fof(c_0_2,negated_conjecture,
~ ! [X1] : i(triple(create_pqp,create_slb,X1)) = create_pq,
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_3,negated_conjecture,
i(triple(create_pqp,create_slb,esk1_0)) != create_pq,
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
fof(c_0_4,plain,
! [X8,X9] : i(triple(X8,create_slb,X9)) = create_pq,
inference(variable_rename,[status(thm)],[ax54]) ).
cnf(c_0_5,negated_conjecture,
i(triple(create_pqp,create_slb,esk1_0)) != create_pq,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
i(triple(X1,create_slb,X2)) = create_pq,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWV414+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n025.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 04:48:22 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.44 Running first-order theorem proving
% 0.16/0.44 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.ncKUcVYOqj/E---3.1_20894.p
% 408.17/300.19 # Version: 3.1pre001
% 408.17/300.19 # Preprocessing class: FSLSSMSSSSSNFFN.
% 408.17/300.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.17/300.19 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 408.17/300.19 # Starting new_bool_3 with 300s (1) cores
% 408.17/300.19 # Starting new_bool_1 with 300s (1) cores
% 408.17/300.19 # Starting sh5l with 300s (1) cores
% 408.17/300.19 # new_bool_1 with pid 20975 completed with status 0
% 408.17/300.19 # Result found by new_bool_1
% 408.17/300.19 # Preprocessing class: FSLSSMSSSSSNFFN.
% 408.17/300.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.17/300.19 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 408.17/300.19 # Starting new_bool_3 with 300s (1) cores
% 408.17/300.19 # Starting new_bool_1 with 300s (1) cores
% 408.17/300.19 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.17/300.19 # Search class: FGUSS-FFSF32-MFFFFFNN
% 408.17/300.19 # partial match(1): FGUSS-FFSF22-MFFFFFNN
% 408.17/300.19 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.17/300.19 # Starting SAT001_MinMin_p005000_rr_RG with 100s (1) cores
% 408.17/300.19 # SAT001_MinMin_p005000_rr_RG with pid 20977 completed with status 0
% 408.17/300.19 # Result found by SAT001_MinMin_p005000_rr_RG
% 408.17/300.19 # Preprocessing class: FSLSSMSSSSSNFFN.
% 408.17/300.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.17/300.19 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 408.17/300.19 # Starting new_bool_3 with 300s (1) cores
% 408.17/300.19 # Starting new_bool_1 with 300s (1) cores
% 408.17/300.19 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.17/300.19 # Search class: FGUSS-FFSF32-MFFFFFNN
% 408.17/300.19 # partial match(1): FGUSS-FFSF22-MFFFFFNN
% 408.17/300.19 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.17/300.19 # Starting SAT001_MinMin_p005000_rr_RG with 100s (1) cores
% 408.17/300.19 # Preprocessing time : 0.002 s
% 408.17/300.19 # Presaturation interreduction done
% 408.17/300.19
% 408.17/300.19 # Proof found!
% 408.17/300.19 # SZS status Theorem
% 408.17/300.19 # SZS output start CNFRefutation
% See solution above
% 408.17/300.19 # Parsed axioms : 63
% 408.17/300.19 # Removed by relevancy pruning/SinE : 55
% 408.17/300.19 # Initial clauses : 12
% 408.17/300.19 # Removed in clause preprocessing : 0
% 408.17/300.19 # Initial clauses in saturation : 12
% 408.17/300.19 # Processed clauses : 4
% 408.17/300.19 # ...of these trivial : 0
% 408.17/300.19 # ...subsumed : 0
% 408.17/300.19 # ...remaining for further processing : 4
% 408.17/300.19 # Other redundant clauses eliminated : 0
% 408.17/300.19 # Clauses deleted for lack of memory : 0
% 408.17/300.19 # Backward-subsumed : 0
% 408.17/300.19 # Backward-rewritten : 1
% 408.17/300.19 # Generated clauses : 0
% 408.17/300.19 # ...of the previous two non-redundant : 0
% 408.17/300.19 # ...aggressively subsumed : 0
% 408.17/300.19 # Contextual simplify-reflections : 0
% 408.17/300.19 # Paramodulations : 0
% 408.17/300.19 # Factorizations : 0
% 408.17/300.19 # NegExts : 0
% 408.17/300.19 # Equation resolutions : 0
% 408.17/300.19 # Total rewrite steps : 1
% 408.17/300.19 # Propositional unsat checks : 0
% 408.17/300.19 # Propositional check models : 0
% 408.17/300.19 # Propositional check unsatisfiable : 0
% 408.17/300.19 # Propositional clauses : 0
% 408.17/300.19 # Propositional clauses after purity: 0
% 408.17/300.19 # Propositional unsat core size : 0
% 408.17/300.19 # Propositional preprocessing time : 0.000
% 408.17/300.19 # Propositional encoding time : 0.000
% 408.17/300.19 # Propositional solver time : 0.000
% 408.17/300.19 # Success case prop preproc time : 0.000
% 408.17/300.19 # Success case prop encoding time : 0.000
% 408.17/300.19 # Success case prop solver time : 0.000
% 408.17/300.19 # Current number of processed clauses : 3
% 408.17/300.19 # Positive orientable unit clauses : 1
% 408.17/300.19 # Positive unorientable unit clauses: 0
% 408.17/300.19 # Negative unit clauses : 2
% 408.17/300.19 # Non-unit-clauses : 0
% 408.17/300.19 # Current number of unprocessed clauses: 8
% 408.17/300.19 # ...number of literals in the above : 16
% 408.17/300.19 # Current number of archived formulas : 0
% 408.17/300.19 # Current number of archived clauses : 1
% 408.17/300.19 # Clause-clause subsumption calls (NU) : 0
% 408.17/300.19 # Rec. Clause-clause subsumption calls : 0
% 408.17/300.19 # Non-unit clause-clause subsumptions : 0
% 408.17/300.19 # Unit Clause-clause subsumption calls : 0
% 408.17/300.19 # Rewrite failures with RHS unbound : 0
% 408.17/300.19 # BW rewrite match attempts : 1
% 408.17/300.19 # BW rewrite match successes : 1
% 408.17/300.19 # Condensation attempts : 0
% 408.17/300.19 # Condensation successes : 0
% 408.17/300.19 # Termbank termtop insertions : 1046
% 408.17/300.19
% 408.17/300.19 # -------------------------------------------------
% 408.17/300.19 # User time : 0.003 s
% 408.17/300.19 # System time : 0.002 s
% 408.17/300.19 # Total time : 0.005 s
% 408.17/300.19 # Maximum resident set size: 1900 pages
% 408.17/300.19
% 408.17/300.19 # -------------------------------------------------
% 408.17/300.19 # User time : 0.006 s
% 408.17/300.19 # System time : 0.003 s
% 408.17/300.19 # Total time : 0.009 s
% 408.17/300.19 # Maximum resident set size: 1748 pages
% 408.17/300.19 % E---3.1 exiting
% 408.17/300.19 % E---3.1 exiting
%------------------------------------------------------------------------------