TSTP Solution File: SWW473^1 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SWW473^1 : TPTP v8.2.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:09 EDT 2024
% Result : Theorem 0.80s 0.63s
% Output : CNFRefutation 0.80s
% 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,
x_a: $tType ).
thf(decl_sort2,type,
pname: $tType ).
thf(decl_51,type,
ord_less_eq_a_o: ( x_a > $o ) > ( x_a > $o ) > $o ).
thf(decl_94,type,
image_pname_a: ( pname > x_a ) > ( pname > $o ) > x_a > $o ).
thf(decl_111,type,
insert_a: x_a > ( x_a > $o ) > x_a > $o ).
thf(decl_117,type,
member_a: x_a > ( x_a > $o ) > $o ).
thf(decl_118,type,
member_pname: pname > ( pname > $o ) > $o ).
thf(decl_120,type,
g: x_a > $o ).
thf(decl_122,type,
u: pname > $o ).
thf(decl_123,type,
mgt_call: pname > x_a ).
thf(decl_125,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/sandbox/tmp/tmp.nJEbbhHPHh/E---3.1_12247.p',conj_6) ).
thf(fact_274_insert__subset,axiom,
! [X557: x_a,X558: x_a > $o,X559: x_a > $o] :
( ( ord_less_eq_a_o @ ( insert_a @ X557 @ X558 ) @ X559 )
<=> ( ( member_a @ X557 @ X559 )
& ( ord_less_eq_a_o @ X558 @ X559 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.nJEbbhHPHh/E---3.1_12247.p',fact_274_insert__subset) ).
thf(conj_1,hypothesis,
ord_less_eq_a_o @ g @ ( image_pname_a @ mgt_call @ u ),
file('/export/starexec/sandbox/tmp/tmp.nJEbbhHPHh/E---3.1_12247.p',conj_1) ).
thf(fact_261_imageI,axiom,
! [X521: pname > x_a,X522: pname,X523: pname > $o] :
( ( member_pname @ X522 @ X523 )
=> ( member_a @ ( X521 @ X522 ) @ ( image_pname_a @ X521 @ X523 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.nJEbbhHPHh/E---3.1_12247.p',fact_261_imageI) ).
thf(conj_4,hypothesis,
member_pname @ pn @ u,
file('/export/starexec/sandbox/tmp/tmp.nJEbbhHPHh/E---3.1_12247.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,
! [X1127: x_a,X1128: x_a > $o,X1129: x_a > $o] :
( ( ( member_a @ X1127 @ X1129 )
| ~ ( ord_less_eq_a_o @ ( insert_a @ X1127 @ X1128 ) @ X1129 ) )
& ( ( ord_less_eq_a_o @ X1128 @ X1129 )
| ~ ( ord_less_eq_a_o @ ( insert_a @ X1127 @ X1128 ) @ X1129 ) )
& ( ~ ( member_a @ X1127 @ X1129 )
| ~ ( ord_less_eq_a_o @ X1128 @ X1129 )
| ( ord_less_eq_a_o @ ( insert_a @ X1127 @ X1128 ) @ X1129 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_274_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,
! [X83: x_a,X2: x_a > $o,X1: x_a > $o] :
( ( ord_less_eq_a_o @ ( insert_a @ X83 @ X2 ) @ X1 )
| ~ ( member_a @ X83 @ 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,
! [X1173: pname > x_a,X1174: pname,X1175: pname > $o] :
( ~ ( member_pname @ X1174 @ X1175 )
| ( member_a @ ( X1173 @ X1174 ) @ ( image_pname_a @ X1173 @ X1175 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_261_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,
! [X87: pname,X21: pname > x_a,X5: pname > $o] :
( ( member_a @ ( X21 @ X87 ) @ ( image_pname_a @ X21 @ X5 ) )
| ~ ( member_pname @ X87 @ X5 ) ),
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.07/0.12 % Problem : SWW473^1 : TPTP v8.2.0. Released v5.3.0.
% 0.07/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jun 19 07:44:54 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.20/0.55 Running higher-order theorem proving
% 0.20/0.55 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.nJEbbhHPHh/E---3.1_12247.p
% 0.80/0.63 # Version: 3.2.0-ho
% 0.80/0.63 # Preprocessing class: HSLMSMSSSSLCHSA.
% 0.80/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.80/0.63 # Starting pre_casc_6 with 1500s (5) cores
% 0.80/0.63 # Starting ehoh_best7 with 300s (1) cores
% 0.80/0.63 # Starting new_bool_8 with 300s (1) cores
% 0.80/0.63 # Starting new_ho_11 with 300s (1) cores
% 0.80/0.63 # pre_casc_6 with pid 12332 completed with status 0
% 0.80/0.63 # Result found by pre_casc_6
% 0.80/0.63 # Preprocessing class: HSLMSMSSSSLCHSA.
% 0.80/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.80/0.63 # Starting pre_casc_6 with 1500s (5) cores
% 0.80/0.63 # SinE strategy is GSinE(CountFormulas,hypos,3,,5,20000,1.0,true)
% 0.80/0.63 # Search class: HGHSM-FSLS32-MHSFFSBN
% 0.80/0.63 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.80/0.63 # Starting new_ho_9 with 975s (1) cores
% 0.80/0.63 # Starting new_ho_4 with 151s (1) cores
% 0.80/0.63 # Starting pre_casc_6 with 151s (1) cores
% 0.80/0.63 # Starting additional_ho_6 with 151s (1) cores
% 0.80/0.63 # Starting additional_ho_7 with 72s (1) cores
% 0.80/0.63 # pre_casc_6 with pid 12339 completed with status 0
% 0.80/0.63 # Result found by pre_casc_6
% 0.80/0.63 # Preprocessing class: HSLMSMSSSSLCHSA.
% 0.80/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.80/0.63 # Starting pre_casc_6 with 1500s (5) cores
% 0.80/0.63 # SinE strategy is GSinE(CountFormulas,hypos,3,,5,20000,1.0,true)
% 0.80/0.63 # Search class: HGHSM-FSLS32-MHSFFSBN
% 0.80/0.63 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.80/0.63 # Starting new_ho_9 with 975s (1) cores
% 0.80/0.63 # Starting new_ho_4 with 151s (1) cores
% 0.80/0.63 # Starting pre_casc_6 with 151s (1) cores
% 0.80/0.63 # Preprocessing time : 0.005 s
% 0.80/0.63
% 0.80/0.63 # Proof found!
% 0.80/0.63 # SZS status Theorem
% 0.80/0.63 # SZS output start CNFRefutation
% See solution above
% 0.80/0.63 # Parsed axioms : 414
% 0.80/0.63 # Removed by relevancy pruning/SinE : 229
% 0.80/0.63 # Initial clauses : 287
% 0.80/0.63 # Removed in clause preprocessing : 5
% 0.80/0.63 # Initial clauses in saturation : 282
% 0.80/0.63 # Processed clauses : 303
% 0.80/0.63 # ...of these trivial : 6
% 0.80/0.63 # ...subsumed : 46
% 0.80/0.63 # ...remaining for further processing : 251
% 0.80/0.63 # Other redundant clauses eliminated : 92
% 0.80/0.63 # Clauses deleted for lack of memory : 0
% 0.80/0.63 # Backward-subsumed : 1
% 0.80/0.63 # Backward-rewritten : 0
% 0.80/0.63 # Generated clauses : 1088
% 0.80/0.63 # ...of the previous two non-redundant : 821
% 0.80/0.63 # ...aggressively subsumed : 0
% 0.80/0.63 # Contextual simplify-reflections : 0
% 0.80/0.63 # Paramodulations : 843
% 0.80/0.63 # Factorizations : 12
% 0.80/0.63 # NegExts : 5
% 0.80/0.63 # Equation resolutions : 96
% 0.80/0.63 # Disequality decompositions : 0
% 0.80/0.63 # Total rewrite steps : 185
% 0.80/0.63 # ...of those cached : 107
% 0.80/0.63 # Propositional unsat checks : 0
% 0.80/0.63 # Propositional check models : 0
% 0.80/0.63 # Propositional check unsatisfiable : 0
% 0.80/0.63 # Propositional clauses : 0
% 0.80/0.63 # Propositional clauses after purity: 0
% 0.80/0.63 # Propositional unsat core size : 0
% 0.80/0.63 # Propositional preprocessing time : 0.000
% 0.80/0.63 # Propositional encoding time : 0.000
% 0.80/0.63 # Propositional solver time : 0.000
% 0.80/0.63 # Success case prop preproc time : 0.000
% 0.80/0.63 # Success case prop encoding time : 0.000
% 0.80/0.63 # Success case prop solver time : 0.000
% 0.80/0.63 # Current number of processed clauses : 213
% 0.80/0.63 # Positive orientable unit clauses : 39
% 0.80/0.63 # Positive unorientable unit clauses: 4
% 0.80/0.63 # Negative unit clauses : 7
% 0.80/0.63 # Non-unit-clauses : 163
% 0.80/0.63 # Current number of unprocessed clauses: 798
% 0.80/0.63 # ...number of literals in the above : 2184
% 0.80/0.63 # Current number of archived formulas : 0
% 0.80/0.63 # Current number of archived clauses : 1
% 0.80/0.63 # Clause-clause subsumption calls (NU) : 4558
% 0.80/0.63 # Rec. Clause-clause subsumption calls : 4226
% 0.80/0.63 # Non-unit clause-clause subsumptions : 41
% 0.80/0.63 # Unit Clause-clause subsumption calls : 544
% 0.80/0.63 # Rewrite failures with RHS unbound : 0
% 0.80/0.63 # BW rewrite match attempts : 44
% 0.80/0.63 # BW rewrite match successes : 6
% 0.80/0.63 # Condensation attempts : 303
% 0.80/0.63 # Condensation successes : 0
% 0.80/0.63 # Termbank termtop insertions : 32436
% 0.80/0.63 # Search garbage collected termcells : 7064
% 0.80/0.63
% 0.80/0.63 # -------------------------------------------------
% 0.80/0.63 # User time : 0.047 s
% 0.80/0.63 # System time : 0.012 s
% 0.80/0.63 # Total time : 0.059 s
% 0.80/0.63 # Maximum resident set size: 3980 pages
% 0.80/0.63
% 0.80/0.63 # -------------------------------------------------
% 0.80/0.63 # User time : 0.207 s
% 0.80/0.63 # System time : 0.033 s
% 0.80/0.63 # Total time : 0.241 s
% 0.80/0.63 # Maximum resident set size: 2636 pages
% 0.80/0.63 % E---3.1 exiting
% 0.80/0.63 % E exiting
%------------------------------------------------------------------------------