TSTP Solution File: SEU373+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU373+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:26:13 EDT 2023
% Result : Theorem 0.23s 0.65s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 7 unt; 0 def)
% Number of atoms : 105 ( 3 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 130 ( 52 ~; 49 |; 10 &)
% ( 2 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-4 aty)
% Number of variables : 47 ( 0 sgn; 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d8_yellow_6,axiom,
! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( net_str(X2,X1)
=> ! [X3] :
( net_str(X3,X1)
=> ( subnetstr(X3,X1,X2)
<=> ( subrelstr(X3,X2)
& the_mapping(X1,X3) = relation_dom_restr_as_relation_of(the_carrier(X2),the_carrier(X1),the_mapping(X1,X2),the_carrier(X3)) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.XqfCSF32dM/E---3.1_5628.p',d8_yellow_6) ).
fof(dt_m1_yellow_6,axiom,
! [X1,X2] :
( ( one_sorted_str(X1)
& net_str(X2,X1) )
=> ! [X3] :
( subnetstr(X3,X1,X2)
=> net_str(X3,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.XqfCSF32dM/E---3.1_5628.p',dt_m1_yellow_6) ).
fof(t19_yellow_6,conjecture,
! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( net_str(X2,X1)
=> ! [X3] :
( subnetstr(X3,X1,X2)
=> subset(the_carrier(X3),the_carrier(X2)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.XqfCSF32dM/E---3.1_5628.p',t19_yellow_6) ).
fof(d13_yellow_0,axiom,
! [X1] :
( rel_str(X1)
=> ! [X2] :
( rel_str(X2)
=> ( subrelstr(X2,X1)
<=> ( subset(the_carrier(X2),the_carrier(X1))
& subset(the_InternalRel(X2),the_InternalRel(X1)) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.XqfCSF32dM/E---3.1_5628.p',d13_yellow_0) ).
fof(dt_m1_yellow_0,axiom,
! [X1] :
( rel_str(X1)
=> ! [X2] :
( subrelstr(X2,X1)
=> rel_str(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.XqfCSF32dM/E---3.1_5628.p',dt_m1_yellow_0) ).
fof(dt_l1_waybel_0,axiom,
! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( net_str(X2,X1)
=> rel_str(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.XqfCSF32dM/E---3.1_5628.p',dt_l1_waybel_0) ).
fof(c_0_6,plain,
! [X51,X52,X53] :
( ( subrelstr(X53,X52)
| ~ subnetstr(X53,X51,X52)
| ~ net_str(X53,X51)
| ~ net_str(X52,X51)
| ~ one_sorted_str(X51) )
& ( the_mapping(X51,X53) = relation_dom_restr_as_relation_of(the_carrier(X52),the_carrier(X51),the_mapping(X51,X52),the_carrier(X53))
| ~ subnetstr(X53,X51,X52)
| ~ net_str(X53,X51)
| ~ net_str(X52,X51)
| ~ one_sorted_str(X51) )
& ( ~ subrelstr(X53,X52)
| the_mapping(X51,X53) != relation_dom_restr_as_relation_of(the_carrier(X52),the_carrier(X51),the_mapping(X51,X52),the_carrier(X53))
| subnetstr(X53,X51,X52)
| ~ net_str(X53,X51)
| ~ net_str(X52,X51)
| ~ one_sorted_str(X51) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d8_yellow_6])])])]) ).
fof(c_0_7,plain,
! [X54,X55,X56] :
( ~ one_sorted_str(X54)
| ~ net_str(X55,X54)
| ~ subnetstr(X56,X54,X55)
| net_str(X56,X54) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m1_yellow_6])])]) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( net_str(X2,X1)
=> ! [X3] :
( subnetstr(X3,X1,X2)
=> subset(the_carrier(X3),the_carrier(X2)) ) ) ),
inference(assume_negation,[status(cth)],[t19_yellow_6]) ).
fof(c_0_9,plain,
! [X189,X190] :
( ( subset(the_carrier(X190),the_carrier(X189))
| ~ subrelstr(X190,X189)
| ~ rel_str(X190)
| ~ rel_str(X189) )
& ( subset(the_InternalRel(X190),the_InternalRel(X189))
| ~ subrelstr(X190,X189)
| ~ rel_str(X190)
| ~ rel_str(X189) )
& ( ~ subset(the_carrier(X190),the_carrier(X189))
| ~ subset(the_InternalRel(X190),the_InternalRel(X189))
| subrelstr(X190,X189)
| ~ rel_str(X190)
| ~ rel_str(X189) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d13_yellow_0])])])]) ).
fof(c_0_10,plain,
! [X191,X192] :
( ~ rel_str(X191)
| ~ subrelstr(X192,X191)
| rel_str(X192) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m1_yellow_0])])]) ).
cnf(c_0_11,plain,
( subrelstr(X1,X2)
| ~ subnetstr(X1,X3,X2)
| ~ net_str(X1,X3)
| ~ net_str(X2,X3)
| ~ one_sorted_str(X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( net_str(X3,X1)
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ subnetstr(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_13,negated_conjecture,
( one_sorted_str(esk1_0)
& net_str(esk2_0,esk1_0)
& subnetstr(esk3_0,esk1_0,esk2_0)
& ~ subset(the_carrier(esk3_0),the_carrier(esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_14,plain,
! [X60,X61] :
( ~ one_sorted_str(X60)
| ~ net_str(X61,X60)
| rel_str(X61) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_waybel_0])])]) ).
cnf(c_0_15,plain,
( subset(the_carrier(X1),the_carrier(X2))
| ~ subrelstr(X1,X2)
| ~ rel_str(X1)
| ~ rel_str(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( rel_str(X2)
| ~ rel_str(X1)
| ~ subrelstr(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( subrelstr(X1,X2)
| ~ subnetstr(X1,X3,X2)
| ~ net_str(X2,X3)
| ~ one_sorted_str(X3) ),
inference(csr,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,negated_conjecture,
subnetstr(esk3_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
net_str(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
one_sorted_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( rel_str(X2)
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( subset(the_carrier(X1),the_carrier(X2))
| ~ subrelstr(X1,X2)
| ~ rel_str(X2) ),
inference(csr,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,negated_conjecture,
subrelstr(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]) ).
cnf(c_0_24,negated_conjecture,
rel_str(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_19]),c_0_20])]) ).
cnf(c_0_25,negated_conjecture,
~ subset(the_carrier(esk3_0),the_carrier(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.17 % Problem : SEU373+2 : TPTP v8.1.2. Released v3.3.0.
% 0.09/0.18 % Command : run_E %s %d THM
% 0.17/0.38 % Computer : n002.cluster.edu
% 0.17/0.38 % Model : x86_64 x86_64
% 0.17/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.38 % Memory : 8042.1875MB
% 0.17/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.38 % CPULimit : 2400
% 0.17/0.38 % WCLimit : 300
% 0.17/0.38 % DateTime : Mon Oct 2 09:18:59 EDT 2023
% 0.17/0.39 % CPUTime :
% 0.23/0.57 Running first-order theorem proving
% 0.23/0.57 Running: /export/starexec/sandbox2/solver/bin/eprover --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.XqfCSF32dM/E---3.1_5628.p
% 0.23/0.65 # Version: 3.1pre001
% 0.23/0.65 # Preprocessing class: FSLMSMSSSSSNFFN.
% 0.23/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.65 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.23/0.65 # Starting new_bool_3 with 600s (2) cores
% 0.23/0.65 # Starting new_bool_1 with 600s (2) cores
% 0.23/0.65 # Starting sh5l with 300s (1) cores
% 0.23/0.65 # new_bool_3 with pid 5708 completed with status 0
% 0.23/0.65 # Result found by new_bool_3
% 0.23/0.65 # Preprocessing class: FSLMSMSSSSSNFFN.
% 0.23/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.65 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.23/0.65 # Starting new_bool_3 with 600s (2) cores
% 0.23/0.65 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.65 # Search class: FGHSM-FSLM32-SFFFFFNN
% 0.23/0.65 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 0.23/0.65 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 254s (1) cores
% 0.23/0.65 # Starting new_bool_3 with 61s (1) cores
% 0.23/0.65 # G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 5711 completed with status 0
% 0.23/0.65 # Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 0.23/0.65 # Preprocessing class: FSLMSMSSSSSNFFN.
% 0.23/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.65 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.23/0.65 # Starting new_bool_3 with 600s (2) cores
% 0.23/0.65 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.65 # Search class: FGHSM-FSLM32-SFFFFFNN
% 0.23/0.65 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 0.23/0.65 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 254s (1) cores
% 0.23/0.65 # Preprocessing time : 0.004 s
% 0.23/0.65
% 0.23/0.65 # Proof found!
% 0.23/0.65 # SZS status Theorem
% 0.23/0.65 # SZS output start CNFRefutation
% See solution above
% 0.23/0.65 # Parsed axioms : 764
% 0.23/0.65 # Removed by relevancy pruning/SinE : 650
% 0.23/0.65 # Initial clauses : 324
% 0.23/0.65 # Removed in clause preprocessing : 4
% 0.23/0.65 # Initial clauses in saturation : 320
% 0.23/0.65 # Processed clauses : 324
% 0.23/0.65 # ...of these trivial : 1
% 0.23/0.65 # ...subsumed : 20
% 0.23/0.65 # ...remaining for further processing : 303
% 0.23/0.65 # Other redundant clauses eliminated : 51
% 0.23/0.65 # Clauses deleted for lack of memory : 0
% 0.23/0.65 # Backward-subsumed : 0
% 0.23/0.65 # Backward-rewritten : 0
% 0.23/0.65 # Generated clauses : 603
% 0.23/0.65 # ...of the previous two non-redundant : 571
% 0.23/0.65 # ...aggressively subsumed : 0
% 0.23/0.65 # Contextual simplify-reflections : 40
% 0.23/0.65 # Paramodulations : 549
% 0.23/0.65 # Factorizations : 2
% 0.23/0.65 # NegExts : 0
% 0.23/0.65 # Equation resolutions : 53
% 0.23/0.65 # Total rewrite steps : 61
% 0.23/0.65 # Propositional unsat checks : 0
% 0.23/0.65 # Propositional check models : 0
% 0.23/0.65 # Propositional check unsatisfiable : 0
% 0.23/0.65 # Propositional clauses : 0
% 0.23/0.65 # Propositional clauses after purity: 0
% 0.23/0.65 # Propositional unsat core size : 0
% 0.23/0.65 # Propositional preprocessing time : 0.000
% 0.23/0.65 # Propositional encoding time : 0.000
% 0.23/0.65 # Propositional solver time : 0.000
% 0.23/0.65 # Success case prop preproc time : 0.000
% 0.23/0.65 # Success case prop encoding time : 0.000
% 0.23/0.65 # Success case prop solver time : 0.000
% 0.23/0.65 # Current number of processed clauses : 253
% 0.23/0.65 # Positive orientable unit clauses : 38
% 0.23/0.65 # Positive unorientable unit clauses: 0
% 0.23/0.65 # Negative unit clauses : 6
% 0.23/0.65 # Non-unit-clauses : 209
% 0.23/0.65 # Current number of unprocessed clauses: 567
% 0.23/0.65 # ...number of literals in the above : 2285
% 0.23/0.65 # Current number of archived formulas : 0
% 0.23/0.65 # Current number of archived clauses : 0
% 0.23/0.65 # Clause-clause subsumption calls (NU) : 25139
% 0.23/0.65 # Rec. Clause-clause subsumption calls : 2629
% 0.23/0.65 # Non-unit clause-clause subsumptions : 60
% 0.23/0.65 # Unit Clause-clause subsumption calls : 196
% 0.23/0.65 # Rewrite failures with RHS unbound : 0
% 0.23/0.65 # BW rewrite match attempts : 2
% 0.23/0.65 # BW rewrite match successes : 0
% 0.23/0.65 # Condensation attempts : 0
% 0.23/0.65 # Condensation successes : 0
% 0.23/0.65 # Termbank termtop insertions : 41847
% 0.23/0.65
% 0.23/0.65 # -------------------------------------------------
% 0.23/0.65 # User time : 0.043 s
% 0.23/0.65 # System time : 0.008 s
% 0.23/0.65 # Total time : 0.051 s
% 0.23/0.65 # Maximum resident set size: 3588 pages
% 0.23/0.65
% 0.23/0.65 # -------------------------------------------------
% 0.23/0.65 # User time : 0.099 s
% 0.23/0.65 # System time : 0.015 s
% 0.23/0.65 # Total time : 0.114 s
% 0.23/0.65 # Maximum resident set size: 2752 pages
% 0.23/0.65 % E---3.1 exiting
% 0.23/0.65 % E---3.1 exiting
%------------------------------------------------------------------------------