TSTP Solution File: SEU353+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU353+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:31:46 EDT 2023
% Result : Theorem 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 44 ( 12 unt; 0 def)
% Number of atoms : 116 ( 22 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 120 ( 48 ~; 39 |; 20 &)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-4 aty)
% Number of variables : 63 ( 0 sgn; 39 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(redefinition_k8_funct_2,axiom,
! [X1,X2,X3,X4] :
( ( ~ empty(X1)
& function(X3)
& quasi_total(X3,X1,X2)
& relation_of2(X3,X1,X2)
& element(X4,X1) )
=> apply_as_element(X1,X2,X3,X4) = apply(X3,X4) ),
file('/export/starexec/sandbox/tmp/tmp.7qZtjDnLes/E---3.1_29941.p',redefinition_k8_funct_2) ).
fof(redefinition_m2_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
<=> relation_of2(X3,X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.7qZtjDnLes/E---3.1_29941.p',redefinition_m2_relset_1) ).
fof(dt_k7_grcat_1,axiom,
! [X1] :
( one_sorted_str(X1)
=> ( function(identity_on_carrier(X1))
& quasi_total(identity_on_carrier(X1),the_carrier(X1),the_carrier(X1))
& relation_of2_as_subset(identity_on_carrier(X1),the_carrier(X1),the_carrier(X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.7qZtjDnLes/E---3.1_29941.p',dt_k7_grcat_1) ).
fof(t91_tmap_1,conjecture,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> apply_as_element(the_carrier(X1),the_carrier(X1),identity_on_carrier(X1),X2) = X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.7qZtjDnLes/E---3.1_29941.p',t91_tmap_1) ).
fof(fc1_struct_0,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ~ empty(the_carrier(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.7qZtjDnLes/E---3.1_29941.p',fc1_struct_0) ).
fof(t35_funct_1,axiom,
! [X1,X2] :
( in(X2,X1)
=> apply(identity_relation(X1),X2) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.7qZtjDnLes/E---3.1_29941.p',t35_funct_1) ).
fof(redefinition_k6_partfun1,axiom,
! [X1] : identity_as_relation_of(X1) = identity_relation(X1),
file('/export/starexec/sandbox/tmp/tmp.7qZtjDnLes/E---3.1_29941.p',redefinition_k6_partfun1) ).
fof(d11_grcat_1,axiom,
! [X1] :
( one_sorted_str(X1)
=> identity_on_carrier(X1) = identity_as_relation_of(the_carrier(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.7qZtjDnLes/E---3.1_29941.p',d11_grcat_1) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.7qZtjDnLes/E---3.1_29941.p',t2_subset) ).
fof(c_0_9,plain,
! [X1,X2,X3,X4] :
( ( ~ empty(X1)
& function(X3)
& quasi_total(X3,X1,X2)
& relation_of2(X3,X1,X2)
& element(X4,X1) )
=> apply_as_element(X1,X2,X3,X4) = apply(X3,X4) ),
inference(fof_simplification,[status(thm)],[redefinition_k8_funct_2]) ).
fof(c_0_10,plain,
! [X41,X42,X43] :
( ( ~ relation_of2_as_subset(X43,X41,X42)
| relation_of2(X43,X41,X42) )
& ( ~ relation_of2(X43,X41,X42)
| relation_of2_as_subset(X43,X41,X42) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_m2_relset_1])]) ).
fof(c_0_11,plain,
! [X16] :
( ( function(identity_on_carrier(X16))
| ~ one_sorted_str(X16) )
& ( quasi_total(identity_on_carrier(X16),the_carrier(X16),the_carrier(X16))
| ~ one_sorted_str(X16) )
& ( relation_of2_as_subset(identity_on_carrier(X16),the_carrier(X16),the_carrier(X16))
| ~ one_sorted_str(X16) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k7_grcat_1])])]) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> apply_as_element(the_carrier(X1),the_carrier(X1),identity_on_carrier(X1),X2) = X2 ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t91_tmap_1])]) ).
fof(c_0_13,plain,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ~ empty(the_carrier(X1)) ),
inference(fof_simplification,[status(thm)],[fc1_struct_0]) ).
fof(c_0_14,plain,
! [X11,X12,X13,X14] :
( empty(X11)
| ~ function(X13)
| ~ quasi_total(X13,X11,X12)
| ~ relation_of2(X13,X11,X12)
| ~ element(X14,X11)
| apply_as_element(X11,X12,X13,X14) = apply(X13,X14) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])]) ).
cnf(c_0_15,plain,
( relation_of2(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( relation_of2_as_subset(identity_on_carrier(X1),the_carrier(X1),the_carrier(X1))
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,negated_conjecture,
( ~ empty_carrier(esk1_0)
& one_sorted_str(esk1_0)
& element(esk2_0,the_carrier(esk1_0))
& apply_as_element(the_carrier(esk1_0),the_carrier(esk1_0),identity_on_carrier(esk1_0),esk2_0) != esk2_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
fof(c_0_18,plain,
! [X17] :
( empty_carrier(X17)
| ~ one_sorted_str(X17)
| ~ empty(the_carrier(X17)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])]) ).
cnf(c_0_19,plain,
( empty(X1)
| apply_as_element(X1,X3,X2,X4) = apply(X2,X4)
| ~ function(X2)
| ~ quasi_total(X2,X1,X3)
| ~ relation_of2(X2,X1,X3)
| ~ element(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( quasi_total(identity_on_carrier(X1),the_carrier(X1),the_carrier(X1))
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,plain,
( relation_of2(identity_on_carrier(X1),the_carrier(X1),the_carrier(X1))
| ~ one_sorted_str(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
( function(identity_on_carrier(X1))
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,negated_conjecture,
~ empty_carrier(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( empty_carrier(X1)
| ~ one_sorted_str(X1)
| ~ empty(the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
one_sorted_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_26,plain,
! [X34,X35] :
( ~ in(X35,X34)
| apply(identity_relation(X34),X35) = X35 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t35_funct_1])]) ).
fof(c_0_27,plain,
! [X37] : identity_as_relation_of(X37) = identity_relation(X37),
inference(variable_rename,[status(thm)],[redefinition_k6_partfun1]) ).
cnf(c_0_28,plain,
( apply_as_element(the_carrier(X1),the_carrier(X1),identity_on_carrier(X1),X2) = apply(identity_on_carrier(X1),X2)
| empty(the_carrier(X1))
| ~ one_sorted_str(X1)
| ~ element(X2,the_carrier(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22]) ).
cnf(c_0_29,negated_conjecture,
element(esk2_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_30,negated_conjecture,
~ empty(the_carrier(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_31,plain,
( apply(identity_relation(X2),X1) = X1
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,plain,
identity_as_relation_of(X1) = identity_relation(X1),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_33,plain,
! [X15] :
( ~ one_sorted_str(X15)
| identity_on_carrier(X15) = identity_as_relation_of(the_carrier(X15)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d11_grcat_1])]) ).
fof(c_0_34,plain,
! [X63,X64] :
( ~ element(X63,X64)
| empty(X64)
| in(X63,X64) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
cnf(c_0_35,negated_conjecture,
apply_as_element(the_carrier(esk1_0),the_carrier(esk1_0),identity_on_carrier(esk1_0),esk2_0) != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_36,negated_conjecture,
apply_as_element(the_carrier(esk1_0),the_carrier(esk1_0),identity_on_carrier(esk1_0),esk2_0) = apply(identity_on_carrier(esk1_0),esk2_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_25])]),c_0_30]) ).
cnf(c_0_37,plain,
( apply(identity_as_relation_of(X1),X2) = X2
| ~ in(X2,X1) ),
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,plain,
( identity_on_carrier(X1) = identity_as_relation_of(the_carrier(X1))
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_39,plain,
( empty(X2)
| in(X1,X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_40,negated_conjecture,
apply(identity_on_carrier(esk1_0),esk2_0) != esk2_0,
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,plain,
( apply(identity_on_carrier(X1),X2) = X2
| ~ one_sorted_str(X1)
| ~ in(X2,the_carrier(X1)) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
in(esk2_0,the_carrier(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_29]),c_0_30]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_25]),c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SEU353+1 : TPTP v8.1.2. Released v3.3.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.11/0.30 % Computer : n023.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 2400
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Mon Oct 2 09:45:07 EDT 2023
% 0.11/0.30 % CPUTime :
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.7qZtjDnLes/E---3.1_29941.p
% 0.15/0.43 # Version: 3.1pre001
% 0.15/0.43 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # Starting sh5l with 300s (1) cores
% 0.15/0.43 # new_bool_3 with pid 30019 completed with status 0
% 0.15/0.43 # Result found by new_bool_3
% 0.15/0.43 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43 # Search class: FGHSM-FFMS31-SFFFFFNN
% 0.15/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 181s (1) cores
% 0.15/0.43 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 30023 completed with status 0
% 0.15/0.43 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.15/0.43 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43 # Search class: FGHSM-FFMS31-SFFFFFNN
% 0.15/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 181s (1) cores
% 0.15/0.43 # Preprocessing time : 0.003 s
% 0.15/0.43
% 0.15/0.43 # Proof found!
% 0.15/0.43 # SZS status Theorem
% 0.15/0.43 # SZS output start CNFRefutation
% See solution above
% 0.15/0.43 # Parsed axioms : 57
% 0.15/0.43 # Removed by relevancy pruning/SinE : 22
% 0.15/0.43 # Initial clauses : 61
% 0.15/0.43 # Removed in clause preprocessing : 7
% 0.15/0.43 # Initial clauses in saturation : 54
% 0.15/0.43 # Processed clauses : 184
% 0.15/0.43 # ...of these trivial : 3
% 0.15/0.43 # ...subsumed : 53
% 0.15/0.43 # ...remaining for further processing : 128
% 0.15/0.43 # Other redundant clauses eliminated : 0
% 0.15/0.43 # Clauses deleted for lack of memory : 0
% 0.15/0.43 # Backward-subsumed : 2
% 0.15/0.43 # Backward-rewritten : 12
% 0.15/0.43 # Generated clauses : 229
% 0.15/0.43 # ...of the previous two non-redundant : 210
% 0.15/0.43 # ...aggressively subsumed : 0
% 0.15/0.43 # Contextual simplify-reflections : 8
% 0.15/0.43 # Paramodulations : 225
% 0.15/0.43 # Factorizations : 4
% 0.15/0.43 # NegExts : 0
% 0.15/0.43 # Equation resolutions : 0
% 0.15/0.43 # Total rewrite steps : 78
% 0.15/0.43 # Propositional unsat checks : 0
% 0.15/0.43 # Propositional check models : 0
% 0.15/0.43 # Propositional check unsatisfiable : 0
% 0.15/0.43 # Propositional clauses : 0
% 0.15/0.43 # Propositional clauses after purity: 0
% 0.15/0.43 # Propositional unsat core size : 0
% 0.15/0.43 # Propositional preprocessing time : 0.000
% 0.15/0.43 # Propositional encoding time : 0.000
% 0.15/0.43 # Propositional solver time : 0.000
% 0.15/0.43 # Success case prop preproc time : 0.000
% 0.15/0.43 # Success case prop encoding time : 0.000
% 0.15/0.43 # Success case prop solver time : 0.000
% 0.15/0.43 # Current number of processed clauses : 114
% 0.15/0.43 # Positive orientable unit clauses : 31
% 0.15/0.43 # Positive unorientable unit clauses: 0
% 0.15/0.43 # Negative unit clauses : 11
% 0.15/0.43 # Non-unit-clauses : 72
% 0.15/0.43 # Current number of unprocessed clauses: 66
% 0.15/0.43 # ...number of literals in the above : 184
% 0.15/0.43 # Current number of archived formulas : 0
% 0.15/0.43 # Current number of archived clauses : 14
% 0.15/0.43 # Clause-clause subsumption calls (NU) : 932
% 0.15/0.43 # Rec. Clause-clause subsumption calls : 531
% 0.15/0.43 # Non-unit clause-clause subsumptions : 40
% 0.15/0.43 # Unit Clause-clause subsumption calls : 198
% 0.15/0.43 # Rewrite failures with RHS unbound : 0
% 0.15/0.43 # BW rewrite match attempts : 11
% 0.15/0.43 # BW rewrite match successes : 10
% 0.15/0.43 # Condensation attempts : 0
% 0.15/0.43 # Condensation successes : 0
% 0.15/0.43 # Termbank termtop insertions : 6135
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.013 s
% 0.15/0.43 # System time : 0.002 s
% 0.15/0.43 # Total time : 0.015 s
% 0.15/0.43 # Maximum resident set size: 1888 pages
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.016 s
% 0.15/0.43 # System time : 0.003 s
% 0.15/0.43 # Total time : 0.019 s
% 0.15/0.43 # Maximum resident set size: 1732 pages
% 0.15/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------