TSTP Solution File: SWW473+6 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWW473+6 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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 : 600s
% DateTime : Thu Jul 21 00:02:23 EDT 2022
% Result : Theorem 15.20s 3.67s
% Output : CNFRefutation 15.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 8 unt; 0 nHn; 10 RR)
% Number of literals : 18 ( 0 equ; 9 neg)
% Maximal clause size : 3 ( 1 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 : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_37,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))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sh6gr29b/input.p',i_0_37) ).
cnf(i_0_728,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),X3)),X4))
| ~ hBOOL(hAPP(fun(X1,bool),bool,hAPP(X1,fun(fun(X1,bool),bool),member(X1),X2),X4))
| ~ hBOOL(hAPP(fun(X1,bool),bool,hAPP(fun(X1,bool),fun(fun(X1,bool),bool),ord_less_eq(fun(X1,bool)),X3),X4)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sh6gr29b/input.p',i_0_728) ).
cnf(i_0_32,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/sandbox/tmp/enigma-theBenchmark.p-sh6gr29b/input.p',i_0_32) ).
cnf(i_0_722,plain,
( hBOOL(hAPP(fun(X1,bool),bool,hAPP(X1,fun(fun(X1,bool),bool),member(X1),hAPP(X2,X1,X3,X4)),hAPP(fun(X2,bool),fun(X1,bool),hAPP(fun(X2,X1),fun(fun(X2,bool),fun(X1,bool)),image(X2,X1),X3),X5)))
| ~ hBOOL(hAPP(fun(X2,bool),bool,hAPP(X2,fun(fun(X2,bool),bool),member(X2),X4),X5)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sh6gr29b/input.p',i_0_722) ).
cnf(i_0_35,hypothesis,
hBOOL(hAPP(fun(pname,bool),bool,hAPP(pname,fun(fun(pname,bool),bool),member(pname),pn),u)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sh6gr29b/input.p',i_0_35) ).
cnf(c_0_734,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))),
i_0_37 ).
cnf(c_0_735,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),X3)),X4))
| ~ hBOOL(hAPP(fun(X1,bool),bool,hAPP(X1,fun(fun(X1,bool),bool),member(X1),X2),X4))
| ~ hBOOL(hAPP(fun(X1,bool),bool,hAPP(fun(X1,bool),fun(fun(X1,bool),bool),ord_less_eq(fun(X1,bool)),X3),X4)) ),
i_0_728 ).
cnf(c_0_736,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))),
i_0_32 ).
cnf(c_0_737,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_734,c_0_735]),c_0_736])]) ).
cnf(c_0_738,plain,
( hBOOL(hAPP(fun(X1,bool),bool,hAPP(X1,fun(fun(X1,bool),bool),member(X1),hAPP(X2,X1,X3,X4)),hAPP(fun(X2,bool),fun(X1,bool),hAPP(fun(X2,X1),fun(fun(X2,bool),fun(X1,bool)),image(X2,X1),X3),X5)))
| ~ hBOOL(hAPP(fun(X2,bool),bool,hAPP(X2,fun(fun(X2,bool),bool),member(X2),X4),X5)) ),
i_0_722 ).
cnf(c_0_739,hypothesis,
hBOOL(hAPP(fun(pname,bool),bool,hAPP(pname,fun(fun(pname,bool),bool),member(pname),pn),u)),
i_0_35 ).
cnf(c_0_740,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_737,c_0_738]),c_0_739])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWW473+6 : TPTP v8.1.0. Released v5.3.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jun 4 14:48:07 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.52 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.52 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.52 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.52 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 15.20/3.67 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 15.20/3.67 # Version: 2.1pre011
% 15.20/3.67 # Preprocessing time : 0.068 s
% 15.20/3.67
% 15.20/3.67 # Proof found!
% 15.20/3.67 # SZS status Theorem
% 15.20/3.67 # SZS output start CNFRefutation
% See solution above
% 15.20/3.67 # Proof object total steps : 12
% 15.20/3.67 # Proof object clause steps : 7
% 15.20/3.67 # Proof object formula steps : 5
% 15.20/3.67 # Proof object conjectures : 3
% 15.20/3.67 # Proof object clause conjectures : 2
% 15.20/3.67 # Proof object formula conjectures : 1
% 15.20/3.67 # Proof object initial clauses used : 5
% 15.20/3.67 # Proof object initial formulas used : 5
% 15.20/3.67 # Proof object generating inferences : 2
% 15.20/3.67 # Proof object simplifying inferences : 4
% 15.20/3.67 # Training examples: 0 positive, 0 negative
% 15.20/3.67 # Parsed axioms : 803
% 15.20/3.67 # Removed by relevancy pruning/SinE : 0
% 15.20/3.67 # Initial clauses : 803
% 15.20/3.67 # Removed in clause preprocessing : 0
% 15.20/3.67 # Initial clauses in saturation : 803
% 15.20/3.67 # Processed clauses : 1436
% 15.20/3.67 # ...of these trivial : 48
% 15.20/3.67 # ...subsumed : 544
% 15.20/3.67 # ...remaining for further processing : 844
% 15.20/3.67 # Other redundant clauses eliminated : 34
% 15.20/3.67 # Clauses deleted for lack of memory : 0
% 15.20/3.67 # Backward-subsumed : 6
% 15.20/3.67 # Backward-rewritten : 35
% 15.20/3.67 # Generated clauses : 25781
% 15.20/3.67 # ...of the previous two non-trivial : 23748
% 15.20/3.67 # Contextual simplify-reflections : 47
% 15.20/3.67 # Paramodulations : 25722
% 15.20/3.67 # Factorizations : 8
% 15.20/3.67 # Equation resolutions : 50
% 15.20/3.67 # Propositional unsat checks : 0
% 15.20/3.67 # Propositional unsat check successes : 0
% 15.20/3.67 # Current number of processed clauses : 790
% 15.20/3.67 # Positive orientable unit clauses : 164
% 15.20/3.67 # Positive unorientable unit clauses: 8
% 15.20/3.67 # Negative unit clauses : 35
% 15.20/3.67 # Non-unit-clauses : 583
% 15.20/3.67 # Current number of unprocessed clauses: 22151
% 15.20/3.67 # ...number of literals in the above : 75307
% 15.20/3.67 # Current number of archived formulas : 0
% 15.20/3.67 # Current number of archived clauses : 42
% 15.20/3.67 # Clause-clause subsumption calls (NU) : 43501
% 15.20/3.67 # Rec. Clause-clause subsumption calls : 27418
% 15.20/3.67 # Non-unit clause-clause subsumptions : 361
% 15.20/3.67 # Unit Clause-clause subsumption calls : 5252
% 15.20/3.67 # Rewrite failures with RHS unbound : 0
% 15.20/3.67 # BW rewrite match attempts : 9604
% 15.20/3.67 # BW rewrite match successes : 66
% 15.20/3.67 # Condensation attempts : 0
% 15.20/3.67 # Condensation successes : 0
% 15.20/3.67 # Termbank termtop insertions : 1926808
% 15.20/3.67
% 15.20/3.67 # -------------------------------------------------
% 15.20/3.67 # User time : 0.830 s
% 15.20/3.67 # System time : 0.021 s
% 15.20/3.67 # Total time : 0.851 s
% 15.20/3.67 # ...preprocessing : 0.068 s
% 15.20/3.67 # ...main loop : 0.784 s
% 15.20/3.67 # Maximum resident set size: 37492 pages
% 15.20/3.67
%------------------------------------------------------------------------------