TSTP Solution File: SWW473^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWW473^2 : TPTP v8.2.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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 : Tue May 21 06:42:57 EDT 2024
% Result : Theorem 0.71s 0.70s
% Output : CNFRefutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 19
% Syntax : Number of formulae : 45 ( 11 unt; 12 typ; 0 def)
% Number of atoms : 118 ( 16 equ; 0 cnn)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 211 ( 19 ~; 15 |; 2 &; 171 @)
% ( 1 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 44 ( 44 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 3 con; 0-3 aty)
% Number of variables : 38 ( 0 ^ 38 !; 0 ?; 38 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
pname: $tType ).
thf(decl_sort2,type,
x_a: $tType ).
thf(decl_57,type,
ord_less_eq_a_o: ( x_a > $o ) > ( x_a > $o ) > $o ).
thf(decl_89,type,
image_pname_a: ( pname > x_a ) > ( pname > $o ) > x_a > $o ).
thf(decl_101,type,
insert_a: x_a > ( x_a > $o ) > x_a > $o ).
thf(decl_102,type,
insert_pname: pname > ( pname > $o ) > pname > $o ).
thf(decl_114,type,
member_pname: pname > ( pname > $o ) > $o ).
thf(decl_116,type,
g: x_a > $o ).
thf(decl_118,type,
u: pname > $o ).
thf(decl_120,type,
mgt_call: pname > x_a ).
thf(decl_122,type,
pn: pname ).
thf(decl_160,type,
esk33_0: x_a ).
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/benchmark/theBenchmark.p',conj_6) ).
thf(conj_1,hypothesis,
ord_less_eq_a_o @ g @ ( image_pname_a @ mgt_call @ u ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).
thf(fact_256_insert__code,axiom,
! [X598: x_a,X599: x_a > $o,X600: x_a] :
( ( insert_a @ X598 @ X599 @ X600 )
<=> ( ( X598 = X600 )
| ( X599 @ X600 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_256_insert__code) ).
thf(fact_264_insert__absorb,axiom,
! [X621: pname,X622: pname > $o] :
( ( member_pname @ X621 @ X622 )
=> ( ( insert_pname @ X621 @ X622 )
= X622 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_264_insert__absorb) ).
thf(fact_333_insert__mono,axiom,
! [X790: x_a,X791: x_a > $o,X792: x_a > $o] :
( ( ord_less_eq_a_o @ X791 @ X792 )
=> ( ord_less_eq_a_o @ ( insert_a @ X790 @ X791 ) @ ( insert_a @ X790 @ X792 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_333_insert__mono) ).
thf(fact_337_image__insert,axiom,
! [X800: pname > x_a,X801: pname,X802: pname > $o] :
( ( image_pname_a @ X800 @ ( insert_pname @ X801 @ X802 ) )
= ( insert_a @ ( X800 @ X801 ) @ ( image_pname_a @ X800 @ X802 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_337_image__insert) ).
thf(conj_4,hypothesis,
member_pname @ pn @ u,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_4) ).
thf(c_0_7,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_8,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_7]) ).
thf(c_0_9,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_8]) ).
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,
( ( insert_a @ ( mgt_call @ pn ) @ g )
!= g ),
inference(ext_sup,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_12,plain,
( ( insert_a @ ( mgt_call @ pn ) @ g @ esk33_0 )
<~> ( g @ esk33_0 ) ),
inference(neg_ext,[status(thm)],[c_0_11]) ).
thf(c_0_13,plain,
! [X2410: x_a,X2411: x_a > $o,X2412: x_a] :
( ( ~ ( insert_a @ X2410 @ X2411 @ X2412 )
| ( X2410 = X2412 )
| ( X2411 @ X2412 ) )
& ( ( X2410 != X2412 )
| ( insert_a @ X2410 @ X2411 @ X2412 ) )
& ( ~ ( X2411 @ X2412 )
| ( insert_a @ X2410 @ X2411 @ X2412 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_256_insert__code])])])]) ).
thf(c_0_14,plain,
( ~ ( insert_a @ ( mgt_call @ pn ) @ g @ esk33_0 )
| ~ ( g @ esk33_0 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_12]) ).
thf(c_0_15,plain,
! [X1: x_a > $o,X114: x_a,X54: x_a] :
( ( insert_a @ X114 @ X1 @ X54 )
| ~ ( X1 @ X54 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_16,plain,
( ( insert_a @ ( mgt_call @ pn ) @ g @ esk33_0 )
| ( g @ esk33_0 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_12]) ).
thf(c_0_17,plain,
~ ( g @ esk33_0 ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_18,plain,
! [X2515: pname,X2516: pname > $o] :
( ~ ( member_pname @ X2515 @ X2516 )
| ( ( insert_pname @ X2515 @ X2516 )
= X2516 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_264_insert__absorb])])]) ).
thf(c_0_19,plain,
! [X2432: x_a,X2433: x_a > $o,X2434: x_a > $o] :
( ~ ( ord_less_eq_a_o @ X2433 @ X2434 )
| ( ord_less_eq_a_o @ ( insert_a @ X2432 @ X2433 ) @ ( insert_a @ X2432 @ X2434 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_333_insert__mono])])]) ).
thf(c_0_20,plain,
! [X1: x_a > $o,X54: x_a,X114: x_a] :
( ( X54 = X114 )
| ( X1 @ X114 )
| ~ ( insert_a @ X54 @ X1 @ X114 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_21,plain,
insert_a @ ( mgt_call @ pn ) @ g @ esk33_0,
inference(sr,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_22,plain,
! [X2140: pname > x_a,X2141: pname,X2142: pname > $o] :
( ( image_pname_a @ X2140 @ ( insert_pname @ X2141 @ X2142 ) )
= ( insert_a @ ( X2140 @ X2141 ) @ ( image_pname_a @ X2140 @ X2142 ) ) ),
inference(variable_rename,[status(thm)],[fact_337_image__insert]) ).
thf(c_0_23,plain,
! [X50: pname,X11: pname > $o] :
( ( ( insert_pname @ X50 @ X11 )
= X11 )
| ~ ( member_pname @ X50 @ X11 ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_24,hypothesis,
member_pname @ pn @ u,
inference(split_conjunct,[status(thm)],[conj_4]) ).
thf(c_0_25,plain,
! [X1: x_a > $o,X54: x_a,X2: x_a > $o] :
( ( ord_less_eq_a_o @ ( insert_a @ X54 @ X1 ) @ ( insert_a @ X54 @ X2 ) )
| ~ ( ord_less_eq_a_o @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_26,plain,
( ( mgt_call @ pn )
= esk33_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_17]) ).
thf(c_0_27,plain,
! [X50: pname,X43: pname > x_a,X11: pname > $o] :
( ( image_pname_a @ X43 @ ( insert_pname @ X50 @ X11 ) )
= ( insert_a @ ( X43 @ X50 ) @ ( image_pname_a @ X43 @ X11 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_28,hypothesis,
( ( insert_pname @ pn @ u )
= u ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
thf(c_0_29,plain,
! [X1: x_a > $o] :
( ( ( image_pname_a @ mgt_call @ u )
!= ( insert_a @ esk33_0 @ X1 ) )
| ~ ( ord_less_eq_a_o @ g @ X1 ) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_9,c_0_25]),c_0_26])])]) ).
thf(c_0_30,hypothesis,
! [X43: pname > x_a] :
( ( insert_a @ ( X43 @ pn ) @ ( image_pname_a @ X43 @ u ) )
= ( image_pname_a @ X43 @ u ) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
thf(c_0_31,hypothesis,
( ( insert_a @ esk33_0 @ ( image_pname_a @ mgt_call @ u ) )
!= ( image_pname_a @ mgt_call @ u ) ),
inference(spm,[status(thm)],[c_0_29,c_0_10]) ).
thf(c_0_32,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_26]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWW473^2 : TPTP v8.2.0. Released v5.3.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n003.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sat May 18 19:26:53 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.46 Running higher-order theorem proving
% 0.19/0.46 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/benchmark/theBenchmark.p
% 0.71/0.70 # Version: 3.1.0-ho
% 0.71/0.70 # Preprocessing class: HSLMSMSSSSLCHSA.
% 0.71/0.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.71/0.70 # Starting pre_casc_6 with 1500s (5) cores
% 0.71/0.70 # Starting ehoh_best7 with 300s (1) cores
% 0.71/0.70 # Starting new_bool_8 with 300s (1) cores
% 0.71/0.70 # Starting new_ho_11 with 300s (1) cores
% 0.71/0.70 # new_bool_8 with pid 26520 completed with status 0
% 0.71/0.70 # Result found by new_bool_8
% 0.71/0.70 # Preprocessing class: HSLMSMSSSSLCHSA.
% 0.71/0.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.71/0.70 # Starting pre_casc_6 with 1500s (5) cores
% 0.71/0.70 # Starting ehoh_best7 with 300s (1) cores
% 0.71/0.70 # Starting new_bool_8 with 300s (1) cores
% 0.71/0.70 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.71/0.70 # Search class: HGHSM-FSLM32-MHSFFFBN
% 0.71/0.70 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.71/0.70 # Starting sh3 with 163s (1) cores
% 0.71/0.70 # sh3 with pid 26522 completed with status 0
% 0.71/0.70 # Result found by sh3
% 0.71/0.70 # Preprocessing class: HSLMSMSSSSLCHSA.
% 0.71/0.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.71/0.70 # Starting pre_casc_6 with 1500s (5) cores
% 0.71/0.70 # Starting ehoh_best7 with 300s (1) cores
% 0.71/0.70 # Starting new_bool_8 with 300s (1) cores
% 0.71/0.70 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.71/0.70 # Search class: HGHSM-FSLM32-MHSFFFBN
% 0.71/0.70 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.71/0.70 # Starting sh3 with 163s (1) cores
% 0.71/0.70 # Preprocessing time : 0.007 s
% 0.71/0.70 # Presaturation interreduction done
% 0.71/0.70
% 0.71/0.70 # Proof found!
% 0.71/0.70 # SZS status Theorem
% 0.71/0.70 # SZS output start CNFRefutation
% See solution above
% 0.71/0.70 # Parsed axioms : 826
% 0.71/0.70 # Removed by relevancy pruning/SinE : 524
% 0.71/0.70 # Initial clauses : 431
% 0.71/0.70 # Removed in clause preprocessing : 30
% 0.71/0.70 # Initial clauses in saturation : 401
% 0.71/0.70 # Processed clauses : 1156
% 0.71/0.70 # ...of these trivial : 17
% 0.71/0.70 # ...subsumed : 413
% 0.71/0.70 # ...remaining for further processing : 726
% 0.71/0.70 # Other redundant clauses eliminated : 191
% 0.71/0.70 # Clauses deleted for lack of memory : 0
% 0.71/0.70 # Backward-subsumed : 8
% 0.71/0.70 # Backward-rewritten : 7
% 0.71/0.70 # Generated clauses : 3838
% 0.71/0.70 # ...of the previous two non-redundant : 3258
% 0.71/0.70 # ...aggressively subsumed : 0
% 0.71/0.70 # Contextual simplify-reflections : 4
% 0.71/0.70 # Paramodulations : 3370
% 0.71/0.70 # Factorizations : 4
% 0.71/0.70 # NegExts : 59
% 0.71/0.70 # Equation resolutions : 201
% 0.71/0.70 # Disequality decompositions : 0
% 0.71/0.70 # Total rewrite steps : 1002
% 0.71/0.70 # ...of those cached : 734
% 0.71/0.70 # Propositional unsat checks : 0
% 0.71/0.70 # Propositional check models : 0
% 0.71/0.70 # Propositional check unsatisfiable : 0
% 0.71/0.70 # Propositional clauses : 0
% 0.71/0.70 # Propositional clauses after purity: 0
% 0.71/0.70 # Propositional unsat core size : 0
% 0.71/0.70 # Propositional preprocessing time : 0.000
% 0.71/0.70 # Propositional encoding time : 0.000
% 0.71/0.70 # Propositional solver time : 0.000
% 0.71/0.70 # Success case prop preproc time : 0.000
% 0.71/0.70 # Success case prop encoding time : 0.000
% 0.71/0.70 # Success case prop solver time : 0.000
% 0.71/0.70 # Current number of processed clauses : 380
% 0.71/0.70 # Positive orientable unit clauses : 72
% 0.71/0.70 # Positive unorientable unit clauses: 5
% 0.71/0.70 # Negative unit clauses : 57
% 0.71/0.70 # Non-unit-clauses : 246
% 0.71/0.70 # Current number of unprocessed clauses: 2725
% 0.71/0.70 # ...number of literals in the above : 6977
% 0.71/0.70 # Current number of archived formulas : 0
% 0.71/0.70 # Current number of archived clauses : 285
% 0.71/0.70 # Clause-clause subsumption calls (NU) : 14181
% 0.71/0.70 # Rec. Clause-clause subsumption calls : 10466
% 0.71/0.70 # Non-unit clause-clause subsumptions : 150
% 0.71/0.70 # Unit Clause-clause subsumption calls : 1636
% 0.71/0.70 # Rewrite failures with RHS unbound : 0
% 0.71/0.70 # BW rewrite match attempts : 90
% 0.71/0.70 # BW rewrite match successes : 49
% 0.71/0.70 # Condensation attempts : 0
% 0.71/0.70 # Condensation successes : 0
% 0.71/0.70 # Termbank termtop insertions : 74400
% 0.71/0.70 # Search garbage collected termcells : 13022
% 0.71/0.70
% 0.71/0.70 # -------------------------------------------------
% 0.71/0.70 # User time : 0.164 s
% 0.71/0.70 # System time : 0.017 s
% 0.71/0.70 # Total time : 0.181 s
% 0.71/0.70 # Maximum resident set size: 4972 pages
% 0.71/0.70
% 0.71/0.70 # -------------------------------------------------
% 0.71/0.70 # User time : 0.192 s
% 0.71/0.70 # System time : 0.023 s
% 0.71/0.70 # Total time : 0.215 s
% 0.71/0.70 # Maximum resident set size: 3492 pages
% 0.71/0.70 % E---3.1 exiting
% 0.71/0.70 % E exiting
%------------------------------------------------------------------------------