TSTP Solution File: SWW473^3 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SWW473^3 : TPTP v8.2.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:12:10 EDT 2024
% Result : Theorem 0.48s 1.04s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 16 ( 1 unt; 0 typ; 0 def)
% Number of atoms : 63 ( 0 equ; 0 cnn)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 127 ( 12 ~; 8 |; 3 &; 102 @)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 9 usr; 2 con; 0-3 aty)
% Number of variables : 18 ( 0 ^ 18 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
pname: $tType ).
thf(decl_sort2,type,
x_a: $tType ).
thf(decl_97,type,
ord_less_eq_a_o: ( x_a > $o ) > ( x_a > $o ) > $o ).
thf(decl_144,type,
image_pname_a: ( pname > x_a ) > ( pname > $o ) > x_a > $o ).
thf(decl_165,type,
insert_a: x_a > ( x_a > $o ) > x_a > $o ).
thf(decl_179,type,
member_a: x_a > ( x_a > $o ) > $o ).
thf(decl_180,type,
member_pname: pname > ( pname > $o ) > $o ).
thf(decl_183,type,
g: x_a > $o ).
thf(decl_185,type,
u: pname > $o ).
thf(decl_187,type,
mgt_call: pname > x_a ).
thf(decl_189,type,
pn: pname ).
thf(conj_6,conjecture,
ord_less_eq_a_o @ ( insert_a @ ( mgt_call @ pn ) @ g ) @ ( image_pname_a @ mgt_call @ u ),
file('/export/starexec/sandbox2/tmp/tmp.2TBKOJaMXv/E---3.1_25721.p',conj_6) ).
thf(fact_453_insert__subset,axiom,
! [X1075: x_a,X1076: x_a > $o,X1077: x_a > $o] :
( ( ord_less_eq_a_o @ ( insert_a @ X1075 @ X1076 ) @ X1077 )
<=> ( ( member_a @ X1075 @ X1077 )
& ( ord_less_eq_a_o @ X1076 @ X1077 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.2TBKOJaMXv/E---3.1_25721.p',fact_453_insert__subset) ).
thf(conj_1,hypothesis,
ord_less_eq_a_o @ g @ ( image_pname_a @ mgt_call @ u ),
file('/export/starexec/sandbox2/tmp/tmp.2TBKOJaMXv/E---3.1_25721.p',conj_1) ).
thf(fact_434_imageI,axiom,
! [X1021: pname > x_a,X1022: pname,X1023: pname > $o] :
( ( member_pname @ X1022 @ X1023 )
=> ( member_a @ ( X1021 @ X1022 ) @ ( image_pname_a @ X1021 @ X1023 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.2TBKOJaMXv/E---3.1_25721.p',fact_434_imageI) ).
thf(conj_4,hypothesis,
member_pname @ pn @ u,
file('/export/starexec/sandbox2/tmp/tmp.2TBKOJaMXv/E---3.1_25721.p',conj_4) ).
thf(c_0_5,negated_conjecture,
~ ( ord_less_eq_a_o @ ( insert_a @ ( mgt_call @ pn ) @ g ) @ ( image_pname_a @ mgt_call @ u ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_6])]) ).
thf(c_0_6,negated_conjecture,
~ ( ord_less_eq_a_o @ ( insert_a @ ( mgt_call @ pn ) @ g ) @ ( image_pname_a @ mgt_call @ u ) ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
thf(c_0_7,plain,
! [X4417: x_a,X4418: x_a > $o,X4419: x_a > $o] :
( ( ( member_a @ X4417 @ X4419 )
| ~ ( ord_less_eq_a_o @ ( insert_a @ X4417 @ X4418 ) @ X4419 ) )
& ( ( ord_less_eq_a_o @ X4418 @ X4419 )
| ~ ( ord_less_eq_a_o @ ( insert_a @ X4417 @ X4418 ) @ X4419 ) )
& ( ~ ( member_a @ X4417 @ X4419 )
| ~ ( ord_less_eq_a_o @ X4418 @ X4419 )
| ( ord_less_eq_a_o @ ( insert_a @ X4417 @ X4418 ) @ X4419 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_453_insert__subset])])])]) ).
thf(c_0_8,negated_conjecture,
~ ( ord_less_eq_a_o @ ( insert_a @ ( mgt_call @ pn ) @ g ) @ ( image_pname_a @ mgt_call @ u ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,plain,
! [X91: x_a,X2: x_a > $o,X1: x_a > $o] :
( ( ord_less_eq_a_o @ ( insert_a @ X91 @ X2 ) @ X1 )
| ~ ( member_a @ X91 @ X1 )
| ~ ( ord_less_eq_a_o @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,hypothesis,
ord_less_eq_a_o @ g @ ( image_pname_a @ mgt_call @ u ),
inference(split_conjunct,[status(thm)],[conj_1]) ).
thf(c_0_11,plain,
! [X4498: pname > x_a,X4499: pname,X4500: pname > $o] :
( ~ ( member_pname @ X4499 @ X4500 )
| ( member_a @ ( X4498 @ X4499 ) @ ( image_pname_a @ X4498 @ X4500 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_434_imageI])])]) ).
thf(c_0_12,negated_conjecture,
~ ( member_a @ ( mgt_call @ pn ) @ ( image_pname_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])]) ).
thf(c_0_13,plain,
! [X85: pname,X74: pname > x_a,X13: pname > $o] :
( ( member_a @ ( X74 @ X85 ) @ ( image_pname_a @ X74 @ X13 ) )
| ~ ( member_pname @ X85 @ X13 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_14,hypothesis,
member_pname @ pn @ u,
inference(split_conjunct,[status(thm)],[conj_4]) ).
thf(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.04/0.12 % Problem : SWW473^3 : TPTP v8.2.0. Released v5.3.0.
% 0.04/0.12 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n016.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 : 300
% 0.13/0.35 % DateTime : Wed Jun 19 09:02:24 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.48/0.64 Running higher-order theorem proving
% 0.48/0.64 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --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.2TBKOJaMXv/E---3.1_25721.p
% 0.48/1.04 # Version: 3.2.0-ho
% 0.48/1.04 # Preprocessing class: HMLMSMSMSSLCHSA.
% 0.48/1.04 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/1.04 # Starting new_ho_10 with 1500s (5) cores
% 0.48/1.04 # Starting sh5l with 300s (1) cores
% 0.48/1.04 # Starting new_bool_1 with 300s (1) cores
% 0.48/1.04 # Starting new_bool_2 with 300s (1) cores
% 0.48/1.04 # sh5l with pid 25800 completed with status 0
% 0.48/1.04 # Result found by sh5l
% 0.48/1.04 # Preprocessing class: HMLMSMSMSSLCHSA.
% 0.48/1.04 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/1.04 # Starting new_ho_10 with 1500s (5) cores
% 0.48/1.04 # Starting sh5l with 300s (1) cores
% 0.48/1.04 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.48/1.04 # Search class: HGHSM-SSLM31-DHSFFSBN
% 0.48/1.04 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.48/1.04 # Starting new_ho_10 with 163s (1) cores
% 0.48/1.04 # new_ho_10 with pid 25805 completed with status 0
% 0.48/1.04 # Result found by new_ho_10
% 0.48/1.04 # Preprocessing class: HMLMSMSMSSLCHSA.
% 0.48/1.04 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/1.04 # Starting new_ho_10 with 1500s (5) cores
% 0.48/1.04 # Starting sh5l with 300s (1) cores
% 0.48/1.04 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.48/1.04 # Search class: HGHSM-SSLM31-DHSFFSBN
% 0.48/1.04 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.48/1.04 # Starting new_ho_10 with 163s (1) cores
% 0.48/1.04 # Preprocessing time : 0.016 s
% 0.48/1.04 # Presaturation interreduction done
% 0.48/1.04
% 0.48/1.04 # Proof found!
% 0.48/1.04 # SZS status Theorem
% 0.48/1.04 # SZS output start CNFRefutation
% See solution above
% 0.48/1.04 # Parsed axioms : 1390
% 0.48/1.04 # Removed by relevancy pruning/SinE : 443
% 0.48/1.04 # Initial clauses : 1495
% 0.48/1.04 # Removed in clause preprocessing : 95
% 0.48/1.04 # Initial clauses in saturation : 1400
% 0.48/1.04 # Processed clauses : 2348
% 0.48/1.04 # ...of these trivial : 49
% 0.48/1.04 # ...subsumed : 549
% 0.48/1.04 # ...remaining for further processing : 1750
% 0.48/1.04 # Other redundant clauses eliminated : 222
% 0.48/1.04 # Clauses deleted for lack of memory : 0
% 0.48/1.04 # Backward-subsumed : 6
% 0.48/1.04 # Backward-rewritten : 15
% 0.48/1.04 # Generated clauses : 3444
% 0.48/1.04 # ...of the previous two non-redundant : 2642
% 0.48/1.04 # ...aggressively subsumed : 0
% 0.48/1.04 # Contextual simplify-reflections : 2
% 0.48/1.04 # Paramodulations : 3033
% 0.48/1.04 # Factorizations : 4
% 0.48/1.04 # NegExts : 12
% 0.48/1.04 # Equation resolutions : 233
% 0.48/1.04 # Disequality decompositions : 0
% 0.48/1.04 # Total rewrite steps : 1336
% 0.48/1.04 # ...of those cached : 984
% 0.48/1.04 # Propositional unsat checks : 0
% 0.48/1.04 # Propositional check models : 0
% 0.48/1.04 # Propositional check unsatisfiable : 0
% 0.48/1.04 # Propositional clauses : 0
% 0.48/1.04 # Propositional clauses after purity: 0
% 0.48/1.04 # Propositional unsat core size : 0
% 0.48/1.04 # Propositional preprocessing time : 0.000
% 0.48/1.04 # Propositional encoding time : 0.000
% 0.48/1.04 # Propositional solver time : 0.000
% 0.48/1.04 # Success case prop preproc time : 0.000
% 0.48/1.04 # Success case prop encoding time : 0.000
% 0.48/1.04 # Success case prop solver time : 0.000
% 0.48/1.04 # Current number of processed clauses : 582
% 0.48/1.04 # Positive orientable unit clauses : 190
% 0.48/1.04 # Positive unorientable unit clauses: 5
% 0.48/1.04 # Negative unit clauses : 64
% 0.48/1.04 # Non-unit-clauses : 323
% 0.48/1.04 # Current number of unprocessed clauses: 2647
% 0.48/1.04 # ...number of literals in the above : 6071
% 0.48/1.04 # Current number of archived formulas : 0
% 0.48/1.04 # Current number of archived clauses : 1016
% 0.48/1.04 # Clause-clause subsumption calls (NU) : 135361
% 0.48/1.04 # Rec. Clause-clause subsumption calls : 86445
% 0.48/1.04 # Non-unit clause-clause subsumptions : 308
% 0.48/1.04 # Unit Clause-clause subsumption calls : 3427
% 0.48/1.04 # Rewrite failures with RHS unbound : 0
% 0.48/1.04 # BW rewrite match attempts : 293
% 0.48/1.04 # BW rewrite match successes : 177
% 0.48/1.04 # Condensation attempts : 2348
% 0.48/1.04 # Condensation successes : 9
% 0.48/1.04 # Termbank termtop insertions : 158594
% 0.48/1.04 # Search garbage collected termcells : 32989
% 0.48/1.04
% 0.48/1.04 # -------------------------------------------------
% 0.48/1.04 # User time : 0.306 s
% 0.48/1.04 # System time : 0.021 s
% 0.48/1.04 # Total time : 0.327 s
% 0.48/1.04 # Maximum resident set size: 9840 pages
% 0.48/1.04
% 0.48/1.04 # -------------------------------------------------
% 0.48/1.04 # User time : 0.353 s
% 0.48/1.04 # System time : 0.026 s
% 0.48/1.04 # Total time : 0.379 s
% 0.48/1.04 # Maximum resident set size: 4720 pages
% 0.48/1.04 % E---3.1 exiting
% 0.48/1.04 % E exiting
%------------------------------------------------------------------------------