TSTP Solution File: SWW473+6 by E-SAT---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.2.0
% Problem : SWW473+6 : TPTP v8.2.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d SAT
% Computer : n015.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:14:45 EDT 2024
% Result : Theorem 0.43s 1.02s
% Output : CNFRefutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 16 ( 10 unt; 0 def)
% Number of atoms : 29 ( 0 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 25 ( 12 ~; 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.qkSblr72Bx/E---3.1_31757.p',conj_6) ).
fof(fact_86_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.qkSblr72Bx/E---3.1_31757.p',fact_86_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.qkSblr72Bx/E---3.1_31757.p',conj_1) ).
fof(fact_80_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.qkSblr72Bx/E---3.1_31757.p',fact_80_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.qkSblr72Bx/E---3.1_31757.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,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_nnf,[status(thm)],[c_0_5]) ).
fof(c_0_7,plain,
! [X768,X769,X770,X771] :
( ( hBOOL(hAPP(fun(X768,bool),bool,hAPP(X768,fun(fun(X768,bool),bool),member(X768),X769),X771))
| ~ hBOOL(hAPP(fun(X768,bool),bool,hAPP(fun(X768,bool),fun(fun(X768,bool),bool),ord_less_eq(fun(X768,bool)),hAPP(fun(X768,bool),fun(X768,bool),hAPP(X768,fun(fun(X768,bool),fun(X768,bool)),insert(X768),X769),X770)),X771)) )
& ( hBOOL(hAPP(fun(X768,bool),bool,hAPP(fun(X768,bool),fun(fun(X768,bool),bool),ord_less_eq(fun(X768,bool)),X770),X771))
| ~ hBOOL(hAPP(fun(X768,bool),bool,hAPP(fun(X768,bool),fun(fun(X768,bool),bool),ord_less_eq(fun(X768,bool)),hAPP(fun(X768,bool),fun(X768,bool),hAPP(X768,fun(fun(X768,bool),fun(X768,bool)),insert(X768),X769),X770)),X771)) )
& ( ~ hBOOL(hAPP(fun(X768,bool),bool,hAPP(X768,fun(fun(X768,bool),bool),member(X768),X769),X771))
| ~ hBOOL(hAPP(fun(X768,bool),bool,hAPP(fun(X768,bool),fun(fun(X768,bool),bool),ord_less_eq(fun(X768,bool)),X770),X771))
| hBOOL(hAPP(fun(X768,bool),bool,hAPP(fun(X768,bool),fun(fun(X768,bool),bool),ord_less_eq(fun(X768,bool)),hAPP(fun(X768,bool),fun(X768,bool),hAPP(X768,fun(fun(X768,bool),fun(X768,bool)),insert(X768),X769),X770)),X771)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_86_insert__subset])])])]) ).
cnf(c_0_8,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_6]) ).
cnf(c_0_9,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_7]) ).
cnf(c_0_10,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_11,plain,
! [X394,X395,X396,X397,X398] :
( ~ hBOOL(hAPP(fun(X395,bool),bool,hAPP(X395,fun(fun(X395,bool),bool),member(X395),X397),X398))
| hBOOL(hAPP(fun(X394,bool),bool,hAPP(X394,fun(fun(X394,bool),bool),member(X394),hAPP(X395,X394,X396,X397)),hAPP(fun(X395,bool),fun(X394,bool),hAPP(fun(X395,X394),fun(fun(X395,bool),fun(X394,bool)),image(X395,X394),X396),X398))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_80_imageI])])]) ).
cnf(c_0_12,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_8,c_0_9]),c_0_10])]) ).
cnf(c_0_13,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_11]) ).
cnf(c_0_14,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_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWW473+6 : TPTP v8.2.0. Released v5.3.0.
% 0.03/0.12 % Command : run_E %s %d SAT
% 0.12/0.35 % Computer : n015.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Wed Jun 19 05:09:24 EDT 2024
% 0.12/0.35 % CPUTime :
% 0.39/0.59 Running first-order model finding
% 0.39/0.59 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.qkSblr72Bx/E---3.1_31757.p
% 0.43/1.02 # Version: 3.2.0
% 0.43/1.02 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.43/1.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/1.02 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.43/1.02 # Starting new_bool_3 with 300s (1) cores
% 0.43/1.02 # Starting new_bool_1 with 300s (1) cores
% 0.43/1.02 # Starting sh5l with 300s (1) cores
% 0.43/1.02 # new_bool_3 with pid 31835 completed with status 0
% 0.43/1.02 # Result found by new_bool_3
% 0.43/1.02 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.43/1.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/1.02 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.43/1.02 # Starting new_bool_3 with 300s (1) cores
% 0.43/1.02 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.43/1.02 # Search class: FGHSM-FSLM32-DFFFFFNN
% 0.43/1.02 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.43/1.02 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 0.43/1.02 # G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 31838 completed with status 0
% 0.43/1.02 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 0.43/1.02 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.43/1.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/1.02 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.43/1.02 # Starting new_bool_3 with 300s (1) cores
% 0.43/1.02 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.43/1.02 # Search class: FGHSM-FSLM32-DFFFFFNN
% 0.43/1.02 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.43/1.02 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 0.43/1.02 # Preprocessing time : 0.058 s
% 0.43/1.02
% 0.43/1.02 # Proof found!
% 0.43/1.02 # SZS status Theorem
% 0.43/1.02 # SZS output start CNFRefutation
% See solution above
% 0.43/1.02 # Parsed axioms : 609
% 0.43/1.02 # Removed by relevancy pruning/SinE : 283
% 0.43/1.02 # Initial clauses : 478
% 0.43/1.02 # Removed in clause preprocessing : 15
% 0.43/1.02 # Initial clauses in saturation : 463
% 0.43/1.02 # Processed clauses : 560
% 0.43/1.02 # ...of these trivial : 23
% 0.43/1.02 # ...subsumed : 142
% 0.43/1.02 # ...remaining for further processing : 395
% 0.43/1.02 # Other redundant clauses eliminated : 31
% 0.43/1.02 # Clauses deleted for lack of memory : 0
% 0.43/1.02 # Backward-subsumed : 1
% 0.43/1.02 # Backward-rewritten : 11
% 0.43/1.02 # Generated clauses : 6836
% 0.43/1.02 # ...of the previous two non-redundant : 6001
% 0.43/1.02 # ...aggressively subsumed : 0
% 0.43/1.02 # Contextual simplify-reflections : 5
% 0.43/1.02 # Paramodulations : 6786
% 0.43/1.02 # Factorizations : 4
% 0.43/1.02 # NegExts : 0
% 0.43/1.02 # Equation resolutions : 46
% 0.43/1.02 # Disequality decompositions : 0
% 0.43/1.02 # Total rewrite steps : 3574
% 0.43/1.02 # ...of those cached : 2680
% 0.43/1.02 # Propositional unsat checks : 0
% 0.43/1.02 # Propositional check models : 0
% 0.43/1.02 # Propositional check unsatisfiable : 0
% 0.43/1.02 # Propositional clauses : 0
% 0.43/1.02 # Propositional clauses after purity: 0
% 0.43/1.02 # Propositional unsat core size : 0
% 0.43/1.02 # Propositional preprocessing time : 0.000
% 0.43/1.02 # Propositional encoding time : 0.000
% 0.43/1.02 # Propositional solver time : 0.000
% 0.43/1.02 # Success case prop preproc time : 0.000
% 0.43/1.02 # Success case prop encoding time : 0.000
% 0.43/1.02 # Success case prop solver time : 0.000
% 0.43/1.02 # Current number of processed clauses : 372
% 0.43/1.02 # Positive orientable unit clauses : 82
% 0.43/1.02 # Positive unorientable unit clauses: 7
% 0.43/1.02 # Negative unit clauses : 24
% 0.43/1.02 # Non-unit-clauses : 259
% 0.43/1.02 # Current number of unprocessed clauses: 5889
% 0.43/1.02 # ...number of literals in the above : 16362
% 0.43/1.02 # Current number of archived formulas : 0
% 0.43/1.02 # Current number of archived clauses : 12
% 0.43/1.02 # Clause-clause subsumption calls (NU) : 10351
% 0.43/1.02 # Rec. Clause-clause subsumption calls : 7963
% 0.43/1.02 # Non-unit clause-clause subsumptions : 117
% 0.43/1.02 # Unit Clause-clause subsumption calls : 681
% 0.43/1.02 # Rewrite failures with RHS unbound : 0
% 0.43/1.02 # BW rewrite match attempts : 2703
% 0.43/1.02 # BW rewrite match successes : 38
% 0.43/1.02 # Condensation attempts : 0
% 0.43/1.02 # Condensation successes : 0
% 0.43/1.02 # Termbank termtop insertions : 550733
% 0.43/1.02 # Search garbage collected termcells : 8396
% 0.43/1.02
% 0.43/1.02 # -------------------------------------------------
% 0.43/1.02 # User time : 0.359 s
% 0.43/1.02 # System time : 0.021 s
% 0.43/1.02 # Total time : 0.380 s
% 0.43/1.02 # Maximum resident set size: 4208 pages
% 0.43/1.02
% 0.43/1.02 # -------------------------------------------------
% 0.43/1.02 # User time : 0.393 s
% 0.43/1.02 # System time : 0.022 s
% 0.43/1.02 # Total time : 0.416 s
% 0.43/1.02 # Maximum resident set size: 2568 pages
% 0.43/1.02 % E---3.1 exiting
% 0.43/1.02 % E exiting
%------------------------------------------------------------------------------