TSTP Solution File: SWV840-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWV840-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:55:28 EDT 2023
% Result : Unsatisfiable 0.76s 0.61s
% Output : CNFRefutation 0.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 7 unt; 0 nHn; 7 RR)
% Number of literals : 15 ( 0 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 9 con; 0-3 aty)
% Number of variables : 18 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_thin_0,axiom,
( c_Hoare__Mirabelle_Ohoare__derivs(X1,X2,X3)
| ~ c_lessequals(X4,X1,tc_fun(tc_Hoare__Mirabelle_Otriple(X3),tc_bool))
| ~ c_Hoare__Mirabelle_Ohoare__derivs(X4,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.nZ58LLUTpM/E---3.1_24974.p',cls_thin_0) ).
cnf(cls_subset__insertI_0,axiom,
c_lessequals(X1,c_Set_Oinsert(X2,X1,X3),tc_fun(X3,tc_bool)),
file('/export/starexec/sandbox/tmp/tmp.nZ58LLUTpM/E---3.1_24974.p',cls_subset__insertI_0) ).
cnf(cls_conjecture_1,negated_conjecture,
~ c_Hoare__Mirabelle_Ohoare__derivs(c_Set_Oinsert(hAPP(hAPP(hAPP(c_Hoare__Mirabelle_Otriple_Otriple(t_a),v_P),hAPP(c_Com_Ocom_OBODY,v_pn)),v_Q),v_G,tc_Hoare__Mirabelle_Otriple(t_a)),c_Set_Oinsert(hAPP(hAPP(hAPP(c_Hoare__Mirabelle_Otriple_Otriple(t_a),v_P),hAPP(c_Option_Othe(tc_Com_Ocom),hAPP(c_Com_Obody,v_pn))),v_Q),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool)),tc_Hoare__Mirabelle_Otriple(t_a)),t_a),
file('/export/starexec/sandbox/tmp/tmp.nZ58LLUTpM/E---3.1_24974.p',cls_conjecture_1) ).
cnf(cls_conjecture_0,negated_conjecture,
c_Hoare__Mirabelle_Ohoare__derivs(v_G,c_Set_Oinsert(hAPP(hAPP(hAPP(c_Hoare__Mirabelle_Otriple_Otriple(t_a),v_P),hAPP(c_Option_Othe(tc_Com_Ocom),hAPP(c_Com_Obody,v_pn))),v_Q),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool)),tc_Hoare__Mirabelle_Otriple(t_a)),t_a),
file('/export/starexec/sandbox/tmp/tmp.nZ58LLUTpM/E---3.1_24974.p',cls_conjecture_0) ).
cnf(c_0_4,axiom,
( c_Hoare__Mirabelle_Ohoare__derivs(X1,X2,X3)
| ~ c_lessequals(X4,X1,tc_fun(tc_Hoare__Mirabelle_Otriple(X3),tc_bool))
| ~ c_Hoare__Mirabelle_Ohoare__derivs(X4,X2,X3) ),
cls_thin_0 ).
cnf(c_0_5,axiom,
c_lessequals(X1,c_Set_Oinsert(X2,X1,X3),tc_fun(X3,tc_bool)),
cls_subset__insertI_0 ).
cnf(c_0_6,negated_conjecture,
~ c_Hoare__Mirabelle_Ohoare__derivs(c_Set_Oinsert(hAPP(hAPP(hAPP(c_Hoare__Mirabelle_Otriple_Otriple(t_a),v_P),hAPP(c_Com_Ocom_OBODY,v_pn)),v_Q),v_G,tc_Hoare__Mirabelle_Otriple(t_a)),c_Set_Oinsert(hAPP(hAPP(hAPP(c_Hoare__Mirabelle_Otriple_Otriple(t_a),v_P),hAPP(c_Option_Othe(tc_Com_Ocom),hAPP(c_Com_Obody,v_pn))),v_Q),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool)),tc_Hoare__Mirabelle_Otriple(t_a)),t_a),
cls_conjecture_1 ).
cnf(c_0_7,plain,
( c_Hoare__Mirabelle_Ohoare__derivs(c_Set_Oinsert(X1,X2,tc_Hoare__Mirabelle_Otriple(X3)),X4,X3)
| ~ c_Hoare__Mirabelle_Ohoare__derivs(X2,X4,X3) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,negated_conjecture,
c_Hoare__Mirabelle_Ohoare__derivs(v_G,c_Set_Oinsert(hAPP(hAPP(hAPP(c_Hoare__Mirabelle_Otriple_Otriple(t_a),v_P),hAPP(c_Option_Othe(tc_Com_Ocom),hAPP(c_Com_Obody,v_pn))),v_Q),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool)),tc_Hoare__Mirabelle_Otriple(t_a)),t_a),
cls_conjecture_0 ).
cnf(c_0_9,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.14 % Problem : SWV840-1 : TPTP v8.1.2. Released v4.1.0.
% 0.10/0.15 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n027.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Oct 3 04:03:46 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.20/0.50 Running first-order theorem proving
% 0.20/0.50 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.nZ58LLUTpM/E---3.1_24974.p
% 0.76/0.61 # Version: 3.1pre001
% 0.76/0.61 # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.76/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.76/0.61 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.76/0.61 # Starting new_bool_3 with 600s (2) cores
% 0.76/0.61 # Starting new_bool_1 with 300s (1) cores
% 0.76/0.61 # Starting sh5l with 300s (1) cores
% 0.76/0.61 # new_bool_3 with pid 25053 completed with status 0
% 0.76/0.61 # Result found by new_bool_3
% 0.76/0.61 # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.76/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.76/0.61 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.76/0.61 # Starting new_bool_3 with 600s (2) cores
% 0.76/0.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.76/0.61 # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.76/0.61 # Scheduled 12 strats onto 2 cores with 600 seconds (600 total)
% 0.76/0.61 # Starting G-E--_303_C18_F1_URBAN_S0Y with 50s (1) cores
% 0.76/0.61 # Starting new_bool_3 with 61s (1) cores
% 0.76/0.61 # G-E--_303_C18_F1_URBAN_S0Y with pid 25056 completed with status 0
% 0.76/0.61 # Result found by G-E--_303_C18_F1_URBAN_S0Y
% 0.76/0.61 # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.76/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.76/0.61 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.76/0.61 # Starting new_bool_3 with 600s (2) cores
% 0.76/0.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.76/0.61 # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.76/0.61 # Scheduled 12 strats onto 2 cores with 600 seconds (600 total)
% 0.76/0.61 # Starting G-E--_303_C18_F1_URBAN_S0Y with 50s (1) cores
% 0.76/0.61 # Preprocessing time : 0.046 s
% 0.76/0.61
% 0.76/0.61 # Proof found!
% 0.76/0.61 # SZS status Unsatisfiable
% 0.76/0.61 # SZS output start CNFRefutation
% See solution above
% 0.76/0.61 # Parsed axioms : 469
% 0.76/0.61 # Removed by relevancy pruning/SinE : 207
% 0.76/0.61 # Initial clauses : 262
% 0.76/0.61 # Removed in clause preprocessing : 0
% 0.76/0.61 # Initial clauses in saturation : 262
% 0.76/0.61 # Processed clauses : 298
% 0.76/0.61 # ...of these trivial : 8
% 0.76/0.61 # ...subsumed : 74
% 0.76/0.61 # ...remaining for further processing : 216
% 0.76/0.61 # Other redundant clauses eliminated : 1
% 0.76/0.61 # Clauses deleted for lack of memory : 0
% 0.76/0.61 # Backward-subsumed : 0
% 0.76/0.61 # Backward-rewritten : 2
% 0.76/0.61 # Generated clauses : 1485
% 0.76/0.61 # ...of the previous two non-redundant : 1111
% 0.76/0.61 # ...aggressively subsumed : 0
% 0.76/0.61 # Contextual simplify-reflections : 0
% 0.76/0.61 # Paramodulations : 1461
% 0.76/0.61 # Factorizations : 0
% 0.76/0.61 # NegExts : 0
% 0.76/0.61 # Equation resolutions : 24
% 0.76/0.61 # Total rewrite steps : 400
% 0.76/0.61 # Propositional unsat checks : 0
% 0.76/0.61 # Propositional check models : 0
% 0.76/0.61 # Propositional check unsatisfiable : 0
% 0.76/0.61 # Propositional clauses : 0
% 0.76/0.61 # Propositional clauses after purity: 0
% 0.76/0.61 # Propositional unsat core size : 0
% 0.76/0.61 # Propositional preprocessing time : 0.000
% 0.76/0.61 # Propositional encoding time : 0.000
% 0.76/0.61 # Propositional solver time : 0.000
% 0.76/0.61 # Success case prop preproc time : 0.000
% 0.76/0.61 # Success case prop encoding time : 0.000
% 0.76/0.61 # Success case prop solver time : 0.000
% 0.76/0.61 # Current number of processed clauses : 214
% 0.76/0.61 # Positive orientable unit clauses : 41
% 0.76/0.61 # Positive unorientable unit clauses: 6
% 0.76/0.61 # Negative unit clauses : 31
% 0.76/0.61 # Non-unit-clauses : 136
% 0.76/0.61 # Current number of unprocessed clauses: 1070
% 0.76/0.61 # ...number of literals in the above : 2308
% 0.76/0.61 # Current number of archived formulas : 0
% 0.76/0.61 # Current number of archived clauses : 2
% 0.76/0.61 # Clause-clause subsumption calls (NU) : 4425
% 0.76/0.61 # Rec. Clause-clause subsumption calls : 4211
% 0.76/0.61 # Non-unit clause-clause subsumptions : 30
% 0.76/0.61 # Unit Clause-clause subsumption calls : 383
% 0.76/0.61 # Rewrite failures with RHS unbound : 0
% 0.76/0.61 # BW rewrite match attempts : 52
% 0.76/0.61 # BW rewrite match successes : 20
% 0.76/0.61 # Condensation attempts : 0
% 0.76/0.61 # Condensation successes : 0
% 0.76/0.61 # Termbank termtop insertions : 29060
% 0.76/0.61
% 0.76/0.61 # -------------------------------------------------
% 0.76/0.61 # User time : 0.072 s
% 0.76/0.61 # System time : 0.016 s
% 0.76/0.61 # Total time : 0.088 s
% 0.76/0.61 # Maximum resident set size: 2484 pages
% 0.76/0.61
% 0.76/0.61 # -------------------------------------------------
% 0.76/0.61 # User time : 0.165 s
% 0.76/0.61 # System time : 0.018 s
% 0.76/0.61 # Total time : 0.183 s
% 0.76/0.61 # Maximum resident set size: 2056 pages
% 0.76/0.61 % E---3.1 exiting
% 0.76/0.62 % E---3.1 exiting
%------------------------------------------------------------------------------