TSTP Solution File: SWW473+7 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWW473+7 : TPTP v8.1.2. Released v5.3.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 20:09:33 EDT 2023
% Result : Theorem 5.32s 1.61s
% Output : CNFRefutation 5.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 15 ( 9 unt; 0 def)
% Number of atoms : 28 ( 0 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 24 ( 11 ~; 8 |; 3 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-4 aty)
% Number of variables : 27 ( 0 sgn; 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_6,conjecture,
hBOOL(hAPP(fun(x_a,bool),bool,hAPP(fun(x_a,bool),fun(fun(x_a,bool),bool),ord_less_eq(fun(x_a,bool)),hAPP(fun(x_a,bool),fun(x_a,bool),hAPP(x_a,fun(fun(x_a,bool),fun(x_a,bool)),insert(x_a),hAPP(pname,x_a,mgt_call,pn)),g)),hAPP(fun(pname,bool),fun(x_a,bool),hAPP(fun(pname,x_a),fun(fun(pname,bool),fun(x_a,bool)),image(pname,x_a),mgt_call),u))),
file('/export/starexec/sandbox2/tmp/tmp.gcLTHr5KgY/E---3.1_28454.p',conj_6) ).
fof(fact_103_insert__subset,axiom,
! [X1,X14,X8,X13] :
( hBOOL(hAPP(fun(X1,bool),bool,hAPP(fun(X1,bool),fun(fun(X1,bool),bool),ord_less_eq(fun(X1,bool)),hAPP(fun(X1,bool),fun(X1,bool),hAPP(X1,fun(fun(X1,bool),fun(X1,bool)),insert(X1),X14),X8)),X13))
<=> ( hBOOL(hAPP(fun(X1,bool),bool,hAPP(X1,fun(fun(X1,bool),bool),member(X1),X14),X13))
& hBOOL(hAPP(fun(X1,bool),bool,hAPP(fun(X1,bool),fun(fun(X1,bool),bool),ord_less_eq(fun(X1,bool)),X8),X13)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.gcLTHr5KgY/E---3.1_28454.p',fact_103_insert__subset) ).
fof(conj_1,hypothesis,
hBOOL(hAPP(fun(x_a,bool),bool,hAPP(fun(x_a,bool),fun(fun(x_a,bool),bool),ord_less_eq(fun(x_a,bool)),g),hAPP(fun(pname,bool),fun(x_a,bool),hAPP(fun(pname,x_a),fun(fun(pname,bool),fun(x_a,bool)),image(pname,x_a),mgt_call),u))),
file('/export/starexec/sandbox2/tmp/tmp.gcLTHr5KgY/E---3.1_28454.p',conj_1) ).
fof(fact_94_imageI,axiom,
! [X2,X1,X12,X14,X8] :
( hBOOL(hAPP(fun(X1,bool),bool,hAPP(X1,fun(fun(X1,bool),bool),member(X1),X14),X8))
=> hBOOL(hAPP(fun(X2,bool),bool,hAPP(X2,fun(fun(X2,bool),bool),member(X2),hAPP(X1,X2,X12,X14)),hAPP(fun(X1,bool),fun(X2,bool),hAPP(fun(X1,X2),fun(fun(X1,bool),fun(X2,bool)),image(X1,X2),X12),X8))) ),
file('/export/starexec/sandbox2/tmp/tmp.gcLTHr5KgY/E---3.1_28454.p',fact_94_imageI) ).
fof(conj_4,hypothesis,
hBOOL(hAPP(fun(pname,bool),bool,hAPP(pname,fun(fun(pname,bool),bool),member(pname),pn),u)),
file('/export/starexec/sandbox2/tmp/tmp.gcLTHr5KgY/E---3.1_28454.p',conj_4) ).
fof(c_0_5,negated_conjecture,
~ hBOOL(hAPP(fun(x_a,bool),bool,hAPP(fun(x_a,bool),fun(fun(x_a,bool),bool),ord_less_eq(fun(x_a,bool)),hAPP(fun(x_a,bool),fun(x_a,bool),hAPP(x_a,fun(fun(x_a,bool),fun(x_a,bool)),insert(x_a),hAPP(pname,x_a,mgt_call,pn)),g)),hAPP(fun(pname,bool),fun(x_a,bool),hAPP(fun(pname,x_a),fun(fun(pname,bool),fun(x_a,bool)),image(pname,x_a),mgt_call),u))),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_6])]) ).
fof(c_0_6,plain,
! [X1043,X1044,X1045,X1046] :
( ( hBOOL(hAPP(fun(X1043,bool),bool,hAPP(X1043,fun(fun(X1043,bool),bool),member(X1043),X1044),X1046))
| ~ hBOOL(hAPP(fun(X1043,bool),bool,hAPP(fun(X1043,bool),fun(fun(X1043,bool),bool),ord_less_eq(fun(X1043,bool)),hAPP(fun(X1043,bool),fun(X1043,bool),hAPP(X1043,fun(fun(X1043,bool),fun(X1043,bool)),insert(X1043),X1044),X1045)),X1046)) )
& ( hBOOL(hAPP(fun(X1043,bool),bool,hAPP(fun(X1043,bool),fun(fun(X1043,bool),bool),ord_less_eq(fun(X1043,bool)),X1045),X1046))
| ~ hBOOL(hAPP(fun(X1043,bool),bool,hAPP(fun(X1043,bool),fun(fun(X1043,bool),bool),ord_less_eq(fun(X1043,bool)),hAPP(fun(X1043,bool),fun(X1043,bool),hAPP(X1043,fun(fun(X1043,bool),fun(X1043,bool)),insert(X1043),X1044),X1045)),X1046)) )
& ( ~ hBOOL(hAPP(fun(X1043,bool),bool,hAPP(X1043,fun(fun(X1043,bool),bool),member(X1043),X1044),X1046))
| ~ hBOOL(hAPP(fun(X1043,bool),bool,hAPP(fun(X1043,bool),fun(fun(X1043,bool),bool),ord_less_eq(fun(X1043,bool)),X1045),X1046))
| hBOOL(hAPP(fun(X1043,bool),bool,hAPP(fun(X1043,bool),fun(fun(X1043,bool),bool),ord_less_eq(fun(X1043,bool)),hAPP(fun(X1043,bool),fun(X1043,bool),hAPP(X1043,fun(fun(X1043,bool),fun(X1043,bool)),insert(X1043),X1044),X1045)),X1046)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_103_insert__subset])])]) ).
cnf(c_0_7,negated_conjecture,
~ hBOOL(hAPP(fun(x_a,bool),bool,hAPP(fun(x_a,bool),fun(fun(x_a,bool),bool),ord_less_eq(fun(x_a,bool)),hAPP(fun(x_a,bool),fun(x_a,bool),hAPP(x_a,fun(fun(x_a,bool),fun(x_a,bool)),insert(x_a),hAPP(pname,x_a,mgt_call,pn)),g)),hAPP(fun(pname,bool),fun(x_a,bool),hAPP(fun(pname,x_a),fun(fun(pname,bool),fun(x_a,bool)),image(pname,x_a),mgt_call),u))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( hBOOL(hAPP(fun(X1,bool),bool,hAPP(fun(X1,bool),fun(fun(X1,bool),bool),ord_less_eq(fun(X1,bool)),hAPP(fun(X1,bool),fun(X1,bool),hAPP(X1,fun(fun(X1,bool),fun(X1,bool)),insert(X1),X2),X4)),X3))
| ~ hBOOL(hAPP(fun(X1,bool),bool,hAPP(X1,fun(fun(X1,bool),bool),member(X1),X2),X3))
| ~ hBOOL(hAPP(fun(X1,bool),bool,hAPP(fun(X1,bool),fun(fun(X1,bool),bool),ord_less_eq(fun(X1,bool)),X4),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,hypothesis,
hBOOL(hAPP(fun(x_a,bool),bool,hAPP(fun(x_a,bool),fun(fun(x_a,bool),bool),ord_less_eq(fun(x_a,bool)),g),hAPP(fun(pname,bool),fun(x_a,bool),hAPP(fun(pname,x_a),fun(fun(pname,bool),fun(x_a,bool)),image(pname,x_a),mgt_call),u))),
inference(split_conjunct,[status(thm)],[conj_1]) ).
fof(c_0_10,plain,
! [X512,X513,X514,X515,X516] :
( ~ hBOOL(hAPP(fun(X513,bool),bool,hAPP(X513,fun(fun(X513,bool),bool),member(X513),X515),X516))
| hBOOL(hAPP(fun(X512,bool),bool,hAPP(X512,fun(fun(X512,bool),bool),member(X512),hAPP(X513,X512,X514,X515)),hAPP(fun(X513,bool),fun(X512,bool),hAPP(fun(X513,X512),fun(fun(X513,bool),fun(X512,bool)),image(X513,X512),X514),X516))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_94_imageI])]) ).
cnf(c_0_11,negated_conjecture,
~ hBOOL(hAPP(fun(x_a,bool),bool,hAPP(x_a,fun(fun(x_a,bool),bool),member(x_a),hAPP(pname,x_a,mgt_call,pn)),hAPP(fun(pname,bool),fun(x_a,bool),hAPP(fun(pname,x_a),fun(fun(pname,bool),fun(x_a,bool)),image(pname,x_a),mgt_call),u))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
cnf(c_0_12,plain,
( hBOOL(hAPP(fun(X4,bool),bool,hAPP(X4,fun(fun(X4,bool),bool),member(X4),hAPP(X1,X4,X5,X2)),hAPP(fun(X1,bool),fun(X4,bool),hAPP(fun(X1,X4),fun(fun(X1,bool),fun(X4,bool)),image(X1,X4),X5),X3)))
| ~ hBOOL(hAPP(fun(X1,bool),bool,hAPP(X1,fun(fun(X1,bool),bool),member(X1),X2),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,hypothesis,
hBOOL(hAPP(fun(pname,bool),bool,hAPP(pname,fun(fun(pname,bool),bool),member(pname),pn),u)),
inference(split_conjunct,[status(thm)],[conj_4]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.31 % Problem : SWW473+7 : TPTP v8.1.2. Released v5.3.0.
% 0.11/0.32 % Command : run_E %s %d THM
% 0.31/0.53 % Computer : n004.cluster.edu
% 0.31/0.53 % Model : x86_64 x86_64
% 0.31/0.53 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.31/0.53 % Memory : 8042.1875MB
% 0.31/0.53 % OS : Linux 3.10.0-693.el7.x86_64
% 0.31/0.53 % CPULimit : 2400
% 0.31/0.53 % WCLimit : 300
% 0.31/0.53 % DateTime : Mon Oct 2 22:44:45 EDT 2023
% 0.31/0.53 % CPUTime :
% 0.65/0.85 Running first-order theorem proving
% 0.65/0.85 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.gcLTHr5KgY/E---3.1_28454.p
% 5.32/1.61 # Version: 3.1pre001
% 5.32/1.61 # Preprocessing class: FMLMSMSMSSSNFFN.
% 5.32/1.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.32/1.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.32/1.61 # Starting new_bool_3 with 300s (1) cores
% 5.32/1.61 # Starting new_bool_1 with 300s (1) cores
% 5.32/1.61 # Starting sh5l with 300s (1) cores
% 5.32/1.61 # new_bool_3 with pid 28547 completed with status 0
% 5.32/1.61 # Result found by new_bool_3
% 5.32/1.61 # Preprocessing class: FMLMSMSMSSSNFFN.
% 5.32/1.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.32/1.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.32/1.61 # Starting new_bool_3 with 300s (1) cores
% 5.32/1.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.32/1.61 # Search class: FGHSM-FSLM32-DFFFFFNN
% 5.32/1.61 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 5.32/1.61 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 5.32/1.61 # G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 28550 completed with status 0
% 5.32/1.61 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 5.32/1.61 # Preprocessing class: FMLMSMSMSSSNFFN.
% 5.32/1.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.32/1.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.32/1.61 # Starting new_bool_3 with 300s (1) cores
% 5.32/1.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.32/1.61 # Search class: FGHSM-FSLM32-DFFFFFNN
% 5.32/1.61 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 5.32/1.61 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 5.32/1.61 # Preprocessing time : 0.090 s
% 5.32/1.61
% 5.32/1.61 # Proof found!
% 5.32/1.61 # SZS status Theorem
% 5.32/1.61 # SZS output start CNFRefutation
% See solution above
% 5.32/1.61 # Parsed axioms : 1201
% 5.32/1.61 # Removed by relevancy pruning/SinE : 672
% 5.32/1.61 # Initial clauses : 857
% 5.32/1.61 # Removed in clause preprocessing : 47
% 5.32/1.61 # Initial clauses in saturation : 810
% 5.32/1.61 # Processed clauses : 1075
% 5.32/1.61 # ...of these trivial : 59
% 5.32/1.61 # ...subsumed : 281
% 5.32/1.61 # ...remaining for further processing : 735
% 5.32/1.61 # Other redundant clauses eliminated : 134
% 5.32/1.61 # Clauses deleted for lack of memory : 0
% 5.32/1.61 # Backward-subsumed : 8
% 5.32/1.61 # Backward-rewritten : 14
% 5.32/1.61 # Generated clauses : 16617
% 5.32/1.61 # ...of the previous two non-redundant : 14716
% 5.32/1.61 # ...aggressively subsumed : 0
% 5.32/1.61 # Contextual simplify-reflections : 6
% 5.32/1.61 # Paramodulations : 16444
% 5.32/1.61 # Factorizations : 10
% 5.32/1.61 # NegExts : 0
% 5.32/1.61 # Equation resolutions : 163
% 5.32/1.61 # Total rewrite steps : 7236
% 5.32/1.61 # Propositional unsat checks : 0
% 5.32/1.61 # Propositional check models : 0
% 5.32/1.61 # Propositional check unsatisfiable : 0
% 5.32/1.61 # Propositional clauses : 0
% 5.32/1.61 # Propositional clauses after purity: 0
% 5.32/1.61 # Propositional unsat core size : 0
% 5.32/1.61 # Propositional preprocessing time : 0.000
% 5.32/1.61 # Propositional encoding time : 0.000
% 5.32/1.61 # Propositional solver time : 0.000
% 5.32/1.61 # Success case prop preproc time : 0.000
% 5.32/1.61 # Success case prop encoding time : 0.000
% 5.32/1.61 # Success case prop solver time : 0.000
% 5.32/1.61 # Current number of processed clauses : 700
% 5.32/1.61 # Positive orientable unit clauses : 127
% 5.32/1.61 # Positive unorientable unit clauses: 10
% 5.32/1.61 # Negative unit clauses : 39
% 5.32/1.61 # Non-unit-clauses : 524
% 5.32/1.61 # Current number of unprocessed clauses: 14427
% 5.32/1.61 # ...number of literals in the above : 43267
% 5.32/1.61 # Current number of archived formulas : 0
% 5.32/1.61 # Current number of archived clauses : 22
% 5.32/1.61 # Clause-clause subsumption calls (NU) : 25388
% 5.32/1.61 # Rec. Clause-clause subsumption calls : 18221
% 5.32/1.61 # Non-unit clause-clause subsumptions : 205
% 5.32/1.61 # Unit Clause-clause subsumption calls : 2372
% 5.32/1.61 # Rewrite failures with RHS unbound : 0
% 5.32/1.61 # BW rewrite match attempts : 5293
% 5.32/1.61 # BW rewrite match successes : 66
% 5.32/1.61 # Condensation attempts : 0
% 5.32/1.61 # Condensation successes : 0
% 5.32/1.61 # Termbank termtop insertions : 1363702
% 5.32/1.61
% 5.32/1.61 # -------------------------------------------------
% 5.32/1.61 # User time : 0.658 s
% 5.32/1.61 # System time : 0.031 s
% 5.32/1.61 # Total time : 0.689 s
% 5.32/1.61 # Maximum resident set size: 5900 pages
% 5.32/1.61
% 5.32/1.61 # -------------------------------------------------
% 5.32/1.61 # User time : 0.694 s
% 5.32/1.61 # System time : 0.035 s
% 5.32/1.61 # Total time : 0.729 s
% 5.32/1.61 # Maximum resident set size: 3384 pages
% 5.32/1.61 % E---3.1 exiting
% 5.32/1.61 % E---3.1 exiting
%------------------------------------------------------------------------------