TSTP Solution File: SWW394+1 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SWW394+1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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:11:52 EDT 2024
% Result : Theorem 2.48s 1.77s
% Output : CNFRefutation 2.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 9 unt; 0 def)
% Number of atoms : 15 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 8 ( 5 ~; 2 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 17 ( 2 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_0,conjecture,
c_Hoare__Mirabelle_Ohoare__derivs(t_a,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),v_t),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_HOL_Obool))),hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),v_t),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_HOL_Obool)))),
file('/export/starexec/sandbox/tmp/tmp.elVV3vyKrN/E---3.1_24300.p',conj_0) ).
fof(fact_asm,axiom,
! [X4,X7,X5] :
( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(tc_Hoare__Mirabelle_Otriple(X5),tc_HOL_Obool)),X7),X4))
=> c_Hoare__Mirabelle_Ohoare__derivs(X5,X4,X7) ),
file('/export/starexec/sandbox/tmp/tmp.elVV3vyKrN/E---3.1_24300.p',fact_asm) ).
fof(fact_subset__refl,axiom,
! [X10,X5] : hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X5,tc_HOL_Obool)),X10),X10)),
file('/export/starexec/sandbox/tmp/tmp.elVV3vyKrN/E---3.1_24300.p',fact_subset__refl) ).
fof(c_0_3,negated_conjecture,
~ c_Hoare__Mirabelle_Ohoare__derivs(t_a,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),v_t),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_HOL_Obool))),hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),v_t),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_HOL_Obool)))),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
fof(c_0_4,plain,
! [X298,X299,X300] :
( ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(tc_Hoare__Mirabelle_Otriple(X300),tc_HOL_Obool)),X299),X298))
| c_Hoare__Mirabelle_Ohoare__derivs(X300,X298,X299) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_asm])])]) ).
fof(c_0_5,plain,
! [X571,X572] : hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X572,tc_HOL_Obool)),X571),X571)),
inference(variable_rename,[status(thm)],[fact_subset__refl]) ).
fof(c_0_6,negated_conjecture,
~ c_Hoare__Mirabelle_Ohoare__derivs(t_a,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),v_t),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_HOL_Obool))),hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),v_t),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_HOL_Obool)))),
inference(fof_nnf,[status(thm)],[c_0_3]) ).
cnf(c_0_7,plain,
( c_Hoare__Mirabelle_Ohoare__derivs(X1,X3,X2)
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(tc_Hoare__Mirabelle_Otriple(X1),tc_HOL_Obool)),X2),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1,tc_HOL_Obool)),X2),X2)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
~ c_Hoare__Mirabelle_Ohoare__derivs(t_a,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),v_t),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_HOL_Obool))),hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),v_t),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_HOL_Obool)))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
c_Hoare__Mirabelle_Ohoare__derivs(X1,X2,X2),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWW394+1 : TPTP v8.2.0. Released v5.2.0.
% 0.07/0.12 % Command : run_E %s %d THM
% 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:54:54 EDT 2024
% 0.12/0.33 % CPUTime :
% 1.07/1.22 Running first-order theorem proving
% 1.07/1.23 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.elVV3vyKrN/E---3.1_24300.p
% 2.48/1.77 # Version: 3.2.0
% 2.48/1.77 # Preprocessing class: FMLMSMSMSSSNFFN.
% 2.48/1.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.48/1.77 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.48/1.77 # Starting new_bool_3 with 300s (1) cores
% 2.48/1.77 # Starting new_bool_1 with 300s (1) cores
% 2.48/1.77 # Starting sh5l with 300s (1) cores
% 2.48/1.77 # new_bool_3 with pid 24379 completed with status 0
% 2.48/1.77 # Result found by new_bool_3
% 2.48/1.77 # Preprocessing class: FMLMSMSMSSSNFFN.
% 2.48/1.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.48/1.77 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.48/1.77 # Starting new_bool_3 with 300s (1) cores
% 2.48/1.77 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.48/1.77 # Search class: FGHSM-FSLM32-DFFFFFNN
% 2.48/1.77 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 2.48/1.77 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 2.48/1.77 # G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 24383 completed with status 0
% 2.48/1.77 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 2.48/1.77 # Preprocessing class: FMLMSMSMSSSNFFN.
% 2.48/1.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.48/1.77 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.48/1.77 # Starting new_bool_3 with 300s (1) cores
% 2.48/1.77 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.48/1.77 # Search class: FGHSM-FSLM32-DFFFFFNN
% 2.48/1.77 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 2.48/1.77 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 2.48/1.77 # Preprocessing time : 0.038 s
% 2.48/1.77
% 2.48/1.77 # Proof found!
% 2.48/1.77 # SZS status Theorem
% 2.48/1.77 # SZS output start CNFRefutation
% See solution above
% 2.48/1.77 # Parsed axioms : 5224
% 2.48/1.77 # Removed by relevancy pruning/SinE : 4699
% 2.48/1.77 # Initial clauses : 767
% 2.48/1.77 # Removed in clause preprocessing : 33
% 2.48/1.77 # Initial clauses in saturation : 734
% 2.48/1.77 # Processed clauses : 738
% 2.48/1.77 # ...of these trivial : 9
% 2.48/1.77 # ...subsumed : 130
% 2.48/1.77 # ...remaining for further processing : 599
% 2.48/1.77 # Other redundant clauses eliminated : 112
% 2.48/1.77 # Clauses deleted for lack of memory : 0
% 2.48/1.77 # Backward-subsumed : 3
% 2.48/1.77 # Backward-rewritten : 9
% 2.48/1.77 # Generated clauses : 12962
% 2.48/1.77 # ...of the previous two non-redundant : 11257
% 2.48/1.77 # ...aggressively subsumed : 0
% 2.48/1.77 # Contextual simplify-reflections : 4
% 2.48/1.77 # Paramodulations : 12820
% 2.48/1.77 # Factorizations : 8
% 2.48/1.77 # NegExts : 0
% 2.48/1.77 # Equation resolutions : 135
% 2.48/1.77 # Disequality decompositions : 0
% 2.48/1.77 # Total rewrite steps : 4598
% 2.48/1.77 # ...of those cached : 3286
% 2.48/1.77 # Propositional unsat checks : 0
% 2.48/1.77 # Propositional check models : 0
% 2.48/1.77 # Propositional check unsatisfiable : 0
% 2.48/1.77 # Propositional clauses : 0
% 2.48/1.77 # Propositional clauses after purity: 0
% 2.48/1.77 # Propositional unsat core size : 0
% 2.48/1.77 # Propositional preprocessing time : 0.000
% 2.48/1.77 # Propositional encoding time : 0.000
% 2.48/1.77 # Propositional solver time : 0.000
% 2.48/1.77 # Success case prop preproc time : 0.000
% 2.48/1.77 # Success case prop encoding time : 0.000
% 2.48/1.77 # Success case prop solver time : 0.000
% 2.48/1.77 # Current number of processed clauses : 563
% 2.48/1.77 # Positive orientable unit clauses : 142
% 2.48/1.77 # Positive unorientable unit clauses: 16
% 2.48/1.77 # Negative unit clauses : 15
% 2.48/1.77 # Non-unit-clauses : 390
% 2.48/1.77 # Current number of unprocessed clauses: 11250
% 2.48/1.77 # ...number of literals in the above : 31168
% 2.48/1.77 # Current number of archived formulas : 0
% 2.48/1.77 # Current number of archived clauses : 12
% 2.48/1.77 # Clause-clause subsumption calls (NU) : 26948
% 2.48/1.77 # Rec. Clause-clause subsumption calls : 17122
% 2.48/1.77 # Non-unit clause-clause subsumptions : 124
% 2.48/1.77 # Unit Clause-clause subsumption calls : 814
% 2.48/1.77 # Rewrite failures with RHS unbound : 22
% 2.48/1.77 # BW rewrite match attempts : 2071
% 2.48/1.77 # BW rewrite match successes : 101
% 2.48/1.77 # Condensation attempts : 0
% 2.48/1.77 # Condensation successes : 0
% 2.48/1.77 # Termbank termtop insertions : 599231
% 2.48/1.77 # Search garbage collected termcells : 54186
% 2.48/1.77
% 2.48/1.77 # -------------------------------------------------
% 2.48/1.77 # User time : 0.379 s
% 2.48/1.77 # System time : 0.039 s
% 2.48/1.77 # Total time : 0.418 s
% 2.48/1.77 # Maximum resident set size: 11160 pages
% 2.48/1.77
% 2.48/1.77 # -------------------------------------------------
% 2.48/1.77 # User time : 0.487 s
% 2.48/1.77 # System time : 0.045 s
% 2.48/1.77 # Total time : 0.532 s
% 2.48/1.77 # Maximum resident set size: 9460 pages
% 2.48/1.77 % E---3.1 exiting
% 2.48/1.78 % E exiting
%------------------------------------------------------------------------------