TSTP Solution File: SWV911-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWV911-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:37 EDT 2023
% Result : Unsatisfiable 1.49s 0.80s
% Output : CNFRefutation 1.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 19 ( 9 unt; 2 nHn; 19 RR)
% Number of literals : 31 ( 0 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 10 con; 0-4 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_3,negated_conjecture,
( ~ hBOOL(hAPP(hAPP(v_Q,v_x),v_xb(X1,X2)))
| ~ c_Hoare__Mirabelle_Ohoare__derivs(v_G,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),c_Hoare__Mirabelle_Otriple_Otriple(X1,v_c,X2,t_a)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool))),t_a) ),
file('/export/starexec/sandbox/tmp/tmp.BwQjhBFd5k/E---3.1_29031.p',cls_conjecture_3) ).
cnf(cls_conjecture_0,negated_conjecture,
c_Hoare__Mirabelle_Ohoare__derivs(v_G,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),c_Hoare__Mirabelle_Otriple_Otriple(v_P,v_c,v_Q,t_a)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool))),t_a),
file('/export/starexec/sandbox/tmp/tmp.BwQjhBFd5k/E---3.1_29031.p',cls_conjecture_0) ).
cnf(cls_conjecture_5,negated_conjecture,
( hBOOL(hAPP(hAPP(X1,X2),v_xb(X3,X1)))
| ~ hBOOL(hAPP(hAPP(X3,X2),v_xa))
| ~ c_Hoare__Mirabelle_Ohoare__derivs(v_G,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),c_Hoare__Mirabelle_Otriple_Otriple(X3,v_c,X1,t_a)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool))),t_a) ),
file('/export/starexec/sandbox/tmp/tmp.BwQjhBFd5k/E---3.1_29031.p',cls_conjecture_5) ).
cnf(cls_conjecture_4,negated_conjecture,
( ~ hBOOL(hAPP(hAPP(v_Q_H,v_x),v_xb(X1,X2)))
| ~ c_Hoare__Mirabelle_Ohoare__derivs(v_G,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),c_Hoare__Mirabelle_Otriple_Otriple(X1,v_c,X2,t_a)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool))),t_a) ),
file('/export/starexec/sandbox/tmp/tmp.BwQjhBFd5k/E---3.1_29031.p',cls_conjecture_4) ).
cnf(cls_conjecture_1,negated_conjecture,
c_Hoare__Mirabelle_Ohoare__derivs(v_G,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),c_Hoare__Mirabelle_Otriple_Otriple(v_P_H,v_c,v_Q_H,t_a)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool))),t_a),
file('/export/starexec/sandbox/tmp/tmp.BwQjhBFd5k/E---3.1_29031.p',cls_conjecture_1) ).
cnf(cls_conjecture_2,negated_conjecture,
( hBOOL(hAPP(hAPP(v_P_H,v_x),v_xa))
| hBOOL(hAPP(hAPP(v_P,v_x),v_xa)) ),
file('/export/starexec/sandbox/tmp/tmp.BwQjhBFd5k/E---3.1_29031.p',cls_conjecture_2) ).
cnf(c_0_6,negated_conjecture,
( ~ hBOOL(hAPP(hAPP(v_Q,v_x),v_xb(X1,X2)))
| ~ c_Hoare__Mirabelle_Ohoare__derivs(v_G,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),c_Hoare__Mirabelle_Otriple_Otriple(X1,v_c,X2,t_a)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool))),t_a) ),
cls_conjecture_3 ).
cnf(c_0_7,negated_conjecture,
c_Hoare__Mirabelle_Ohoare__derivs(v_G,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),c_Hoare__Mirabelle_Otriple_Otriple(v_P,v_c,v_Q,t_a)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool))),t_a),
cls_conjecture_0 ).
cnf(c_0_8,negated_conjecture,
( hBOOL(hAPP(hAPP(X1,X2),v_xb(X3,X1)))
| ~ hBOOL(hAPP(hAPP(X3,X2),v_xa))
| ~ c_Hoare__Mirabelle_Ohoare__derivs(v_G,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),c_Hoare__Mirabelle_Otriple_Otriple(X3,v_c,X1,t_a)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool))),t_a) ),
cls_conjecture_5 ).
cnf(c_0_9,negated_conjecture,
~ hBOOL(hAPP(hAPP(v_Q,v_x),v_xb(v_P,v_Q))),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
( hBOOL(hAPP(hAPP(v_Q,X1),v_xb(v_P,v_Q)))
| ~ hBOOL(hAPP(hAPP(v_P,X1),v_xa)) ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( ~ hBOOL(hAPP(hAPP(v_Q_H,v_x),v_xb(X1,X2)))
| ~ c_Hoare__Mirabelle_Ohoare__derivs(v_G,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),c_Hoare__Mirabelle_Otriple_Otriple(X1,v_c,X2,t_a)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool))),t_a) ),
cls_conjecture_4 ).
cnf(c_0_12,negated_conjecture,
c_Hoare__Mirabelle_Ohoare__derivs(v_G,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(t_a)),c_Hoare__Mirabelle_Otriple_Otriple(v_P_H,v_c,v_Q_H,t_a)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool))),t_a),
cls_conjecture_1 ).
cnf(c_0_13,negated_conjecture,
( hBOOL(hAPP(hAPP(v_P_H,v_x),v_xa))
| hBOOL(hAPP(hAPP(v_P,v_x),v_xa)) ),
cls_conjecture_2 ).
cnf(c_0_14,negated_conjecture,
~ hBOOL(hAPP(hAPP(v_P,v_x),v_xa)),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,negated_conjecture,
~ hBOOL(hAPP(hAPP(v_Q_H,v_x),v_xb(v_P_H,v_Q_H))),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( hBOOL(hAPP(hAPP(v_Q_H,X1),v_xb(v_P_H,v_Q_H)))
| ~ hBOOL(hAPP(hAPP(v_P_H,X1),v_xa)) ),
inference(spm,[status(thm)],[c_0_8,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
hBOOL(hAPP(hAPP(v_P_H,v_x),v_xa)),
inference(sr,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.18 % Problem : SWV911-1 : TPTP v8.1.2. Released v4.1.0.
% 0.12/0.19 % Command : run_E %s %d THM
% 0.19/0.40 % Computer : n004.cluster.edu
% 0.19/0.40 % Model : x86_64 x86_64
% 0.19/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.40 % Memory : 8042.1875MB
% 0.19/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.41 % CPULimit : 2400
% 0.19/0.41 % WCLimit : 300
% 0.19/0.41 % DateTime : Tue Oct 3 03:18:00 EDT 2023
% 0.19/0.41 % CPUTime :
% 0.25/0.59 Running first-order theorem proving
% 0.25/0.59 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.BwQjhBFd5k/E---3.1_29031.p
% 1.49/0.80 # Version: 3.1pre001
% 1.49/0.80 # Preprocessing class: FSLMSMSMSSSNFFN.
% 1.49/0.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.49/0.80 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 1.49/0.80 # Starting new_bool_3 with 600s (2) cores
% 1.49/0.80 # Starting new_bool_1 with 300s (1) cores
% 1.49/0.80 # Starting sh5l with 300s (1) cores
% 1.49/0.80 # new_bool_1 with pid 29162 completed with status 0
% 1.49/0.80 # Result found by new_bool_1
% 1.49/0.80 # Preprocessing class: FSLMSMSMSSSNFFN.
% 1.49/0.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.49/0.80 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 1.49/0.80 # Starting new_bool_3 with 600s (2) cores
% 1.49/0.80 # Starting new_bool_1 with 300s (1) cores
% 1.49/0.80 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.49/0.80 # Search class: FGHSM-FSLM32-DFFFFFNN
% 1.49/0.80 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1.49/0.80 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 1.49/0.80 # G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 29166 completed with status 0
% 1.49/0.80 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 1.49/0.80 # Preprocessing class: FSLMSMSMSSSNFFN.
% 1.49/0.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.49/0.80 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 1.49/0.80 # Starting new_bool_3 with 600s (2) cores
% 1.49/0.80 # Starting new_bool_1 with 300s (1) cores
% 1.49/0.80 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.49/0.80 # Search class: FGHSM-FSLM32-DFFFFFNN
% 1.49/0.80 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1.49/0.80 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 1.49/0.80 # Preprocessing time : 0.083 s
% 1.49/0.80
% 1.49/0.80 # Proof found!
% 1.49/0.80 # SZS status Unsatisfiable
% 1.49/0.80 # SZS output start CNFRefutation
% See solution above
% 1.49/0.80 # Parsed axioms : 565
% 1.49/0.80 # Removed by relevancy pruning/SinE : 282
% 1.49/0.80 # Initial clauses : 283
% 1.49/0.80 # Removed in clause preprocessing : 0
% 1.49/0.80 # Initial clauses in saturation : 283
% 1.49/0.80 # Processed clauses : 315
% 1.49/0.80 # ...of these trivial : 16
% 1.49/0.80 # ...subsumed : 54
% 1.49/0.80 # ...remaining for further processing : 245
% 1.49/0.80 # Other redundant clauses eliminated : 4
% 1.49/0.80 # Clauses deleted for lack of memory : 0
% 1.49/0.80 # Backward-subsumed : 0
% 1.49/0.80 # Backward-rewritten : 4
% 1.49/0.80 # Generated clauses : 3917
% 1.49/0.80 # ...of the previous two non-redundant : 3287
% 1.49/0.80 # ...aggressively subsumed : 0
% 1.49/0.80 # Contextual simplify-reflections : 3
% 1.49/0.80 # Paramodulations : 3903
% 1.49/0.80 # Factorizations : 0
% 1.49/0.80 # NegExts : 0
% 1.49/0.80 # Equation resolutions : 13
% 1.49/0.80 # Total rewrite steps : 954
% 1.49/0.80 # Propositional unsat checks : 0
% 1.49/0.80 # Propositional check models : 0
% 1.49/0.80 # Propositional check unsatisfiable : 0
% 1.49/0.80 # Propositional clauses : 0
% 1.49/0.80 # Propositional clauses after purity: 0
% 1.49/0.80 # Propositional unsat core size : 0
% 1.49/0.80 # Propositional preprocessing time : 0.000
% 1.49/0.80 # Propositional encoding time : 0.000
% 1.49/0.80 # Propositional solver time : 0.000
% 1.49/0.80 # Success case prop preproc time : 0.000
% 1.49/0.80 # Success case prop encoding time : 0.000
% 1.49/0.80 # Success case prop solver time : 0.000
% 1.49/0.80 # Current number of processed clauses : 240
% 1.49/0.80 # Positive orientable unit clauses : 66
% 1.49/0.80 # Positive unorientable unit clauses: 11
% 1.49/0.80 # Negative unit clauses : 10
% 1.49/0.80 # Non-unit-clauses : 153
% 1.49/0.80 # Current number of unprocessed clauses: 3253
% 1.49/0.80 # ...number of literals in the above : 7977
% 1.49/0.80 # Current number of archived formulas : 0
% 1.49/0.80 # Current number of archived clauses : 5
% 1.49/0.80 # Clause-clause subsumption calls (NU) : 3289
% 1.49/0.80 # Rec. Clause-clause subsumption calls : 2810
% 1.49/0.80 # Non-unit clause-clause subsumptions : 39
% 1.49/0.80 # Unit Clause-clause subsumption calls : 481
% 1.49/0.80 # Rewrite failures with RHS unbound : 0
% 1.49/0.80 # BW rewrite match attempts : 503
% 1.49/0.80 # BW rewrite match successes : 34
% 1.49/0.80 # Condensation attempts : 0
% 1.49/0.80 # Condensation successes : 0
% 1.49/0.80 # Termbank termtop insertions : 90033
% 1.49/0.80
% 1.49/0.80 # -------------------------------------------------
% 1.49/0.80 # User time : 0.159 s
% 1.49/0.80 # System time : 0.019 s
% 1.49/0.80 # Total time : 0.178 s
% 1.49/0.80 # Maximum resident set size: 2620 pages
% 1.49/0.80
% 1.49/0.80 # -------------------------------------------------
% 1.49/0.80 # User time : 0.175 s
% 1.49/0.80 # System time : 0.021 s
% 1.49/0.80 # Total time : 0.196 s
% 1.49/0.80 # Maximum resident set size: 2144 pages
% 1.49/0.80 % E---3.1 exiting
% 1.49/0.80 % E---3.1 exiting
%------------------------------------------------------------------------------