TSTP Solution File: TOP025+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : TOP025+1 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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 20:51:34 EDT 2023
% Result : Theorem 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 33 ( 11 unt; 0 def)
% Number of atoms : 142 ( 21 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 167 ( 58 ~; 54 |; 31 &)
% ( 3 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn; 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d5_tsp_2,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( v1_tsp_2(X2,X1)
<=> ( v1_tsp_1(X2,X1)
& k3_tex_4(X1,X2) = u1_struct_0(X1) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.9RUaGiOPj3/E---3.1_14089.p',d5_tsp_2) ).
fof(t3_tsp_2,conjecture,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ~ ( ( v3_pre_topc(X2,X1)
| v4_pre_topc(X2,X1) )
& v1_tsp_2(X2,X1)
& v1_tex_2(X2,k1_zfmisc_1(u1_struct_0(X1))) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.9RUaGiOPj3/E---3.1_14089.p',t3_tsp_2) ).
fof(t62_tex_4,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( v4_pre_topc(X2,X1)
=> k3_tex_4(X1,X2) = X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.9RUaGiOPj3/E---3.1_14089.p',t62_tex_4) ).
fof(t58_tex_4,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( v3_pre_topc(X2,X1)
=> k3_tex_4(X1,X2) = X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.9RUaGiOPj3/E---3.1_14089.p',t58_tex_4) ).
fof(t5_tex_2,axiom,
! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(X1))
=> ( v1_tex_2(X2,k1_zfmisc_1(X1))
<=> X2 != X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.9RUaGiOPj3/E---3.1_14089.p',t5_tex_2) ).
fof(c_0_5,plain,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( v1_tsp_2(X2,X1)
<=> ( v1_tsp_1(X2,X1)
& k3_tex_4(X1,X2) = u1_struct_0(X1) ) ) ) ),
inference(fof_simplification,[status(thm)],[d5_tsp_2]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ~ ( ( v3_pre_topc(X2,X1)
| v4_pre_topc(X2,X1) )
& v1_tsp_2(X2,X1)
& v1_tex_2(X2,k1_zfmisc_1(u1_struct_0(X1))) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t3_tsp_2])]) ).
fof(c_0_7,plain,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( v4_pre_topc(X2,X1)
=> k3_tex_4(X1,X2) = X2 ) ) ),
inference(fof_simplification,[status(thm)],[t62_tex_4]) ).
fof(c_0_8,plain,
! [X45,X46] :
( ( v1_tsp_1(X46,X45)
| ~ v1_tsp_2(X46,X45)
| ~ m1_subset_1(X46,k1_zfmisc_1(u1_struct_0(X45)))
| v3_struct_0(X45)
| ~ v2_pre_topc(X45)
| ~ l1_pre_topc(X45) )
& ( k3_tex_4(X45,X46) = u1_struct_0(X45)
| ~ v1_tsp_2(X46,X45)
| ~ m1_subset_1(X46,k1_zfmisc_1(u1_struct_0(X45)))
| v3_struct_0(X45)
| ~ v2_pre_topc(X45)
| ~ l1_pre_topc(X45) )
& ( ~ v1_tsp_1(X46,X45)
| k3_tex_4(X45,X46) != u1_struct_0(X45)
| v1_tsp_2(X46,X45)
| ~ m1_subset_1(X46,k1_zfmisc_1(u1_struct_0(X45)))
| v3_struct_0(X45)
| ~ v2_pre_topc(X45)
| ~ l1_pre_topc(X45) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_9,negated_conjecture,
( ~ v3_struct_0(esk1_0)
& v2_pre_topc(esk1_0)
& l1_pre_topc(esk1_0)
& m1_subset_1(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0)))
& ( v3_pre_topc(esk2_0,esk1_0)
| v4_pre_topc(esk2_0,esk1_0) )
& v1_tsp_2(esk2_0,esk1_0)
& v1_tex_2(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_10,plain,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( v3_pre_topc(X2,X1)
=> k3_tex_4(X1,X2) = X2 ) ) ),
inference(fof_simplification,[status(thm)],[t58_tex_4]) ).
fof(c_0_11,plain,
! [X95,X96] :
( v3_struct_0(X95)
| ~ v2_pre_topc(X95)
| ~ l1_pre_topc(X95)
| ~ m1_subset_1(X96,k1_zfmisc_1(u1_struct_0(X95)))
| ~ v4_pre_topc(X96,X95)
| k3_tex_4(X95,X96) = X96 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_12,plain,
( k3_tex_4(X1,X2) = u1_struct_0(X1)
| v3_struct_0(X1)
| ~ v1_tsp_2(X2,X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ v2_pre_topc(X1)
| ~ l1_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
m1_subset_1(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
v1_tsp_2(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
l1_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
v2_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_18,plain,
! [X88,X89] :
( v3_struct_0(X88)
| ~ v2_pre_topc(X88)
| ~ l1_pre_topc(X88)
| ~ m1_subset_1(X89,k1_zfmisc_1(u1_struct_0(X88)))
| ~ v3_pre_topc(X89,X88)
| k3_tex_4(X88,X89) = X89 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
cnf(c_0_19,plain,
( v3_struct_0(X1)
| k3_tex_4(X1,X2) = X2
| ~ v2_pre_topc(X1)
| ~ l1_pre_topc(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ v4_pre_topc(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,negated_conjecture,
k3_tex_4(esk1_0,esk2_0) = u1_struct_0(esk1_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]),c_0_16])]),c_0_17]) ).
cnf(c_0_21,plain,
( v3_struct_0(X1)
| k3_tex_4(X1,X2) = X2
| ~ v2_pre_topc(X1)
| ~ l1_pre_topc(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ v3_pre_topc(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_22,plain,
! [X93,X94] :
( ( ~ v1_tex_2(X94,k1_zfmisc_1(X93))
| X94 != X93
| ~ m1_subset_1(X94,k1_zfmisc_1(X93)) )
& ( X94 = X93
| v1_tex_2(X94,k1_zfmisc_1(X93))
| ~ m1_subset_1(X94,k1_zfmisc_1(X93)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_tex_2])])]) ).
cnf(c_0_23,negated_conjecture,
( u1_struct_0(esk1_0) = esk2_0
| ~ v4_pre_topc(esk2_0,esk1_0) ),
inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_13]),c_0_15]),c_0_16])]),c_0_17]),c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( v3_pre_topc(esk2_0,esk1_0)
| v4_pre_topc(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_25,negated_conjecture,
( u1_struct_0(esk1_0) = esk2_0
| ~ v3_pre_topc(esk2_0,esk1_0) ),
inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_13]),c_0_15]),c_0_16])]),c_0_17]),c_0_20]) ).
cnf(c_0_26,plain,
( ~ v1_tex_2(X1,k1_zfmisc_1(X2))
| X1 != X2
| ~ m1_subset_1(X1,k1_zfmisc_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,negated_conjecture,
v1_tex_2(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_28,negated_conjecture,
u1_struct_0(esk1_0) = esk2_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_29,plain,
( ~ v1_tex_2(X1,k1_zfmisc_1(X1))
| ~ m1_subset_1(X1,k1_zfmisc_1(X1)) ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_30,negated_conjecture,
v1_tex_2(esk2_0,k1_zfmisc_1(esk2_0)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
m1_subset_1(esk2_0,k1_zfmisc_1(esk2_0)),
inference(spm,[status(thm)],[c_0_13,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.08 % Problem : TOP025+1 : TPTP v8.1.2. Released v3.4.0.
% 0.02/0.09 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n031.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 2400
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon Oct 2 19:32:58 EDT 2023
% 0.09/0.29 % CPUTime :
% 0.14/0.39 Running first-order model finding
% 0.14/0.39 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.9RUaGiOPj3/E---3.1_14089.p
% 0.14/0.41 # Version: 3.1pre001
% 0.14/0.41 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 # Starting sh5l with 300s (1) cores
% 0.14/0.41 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 14166 completed with status 0
% 0.14/0.41 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.14/0.41 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.41 # No SInE strategy applied
% 0.14/0.41 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.14/0.41 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.41 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 0.14/0.41 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.41 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.14/0.41 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.14/0.41 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 14173 completed with status 0
% 0.14/0.41 # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S0S
% 0.14/0.41 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.41 # No SInE strategy applied
% 0.14/0.41 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.14/0.41 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.41 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 0.14/0.41 # Preprocessing time : 0.002 s
% 0.14/0.41
% 0.14/0.41 # Proof found!
% 0.14/0.41 # SZS status Theorem
% 0.14/0.41 # SZS output start CNFRefutation
% See solution above
% 0.14/0.41 # Parsed axioms : 61
% 0.14/0.41 # Removed by relevancy pruning/SinE : 0
% 0.14/0.41 # Initial clauses : 146
% 0.14/0.41 # Removed in clause preprocessing : 8
% 0.14/0.41 # Initial clauses in saturation : 138
% 0.14/0.41 # Processed clauses : 163
% 0.14/0.41 # ...of these trivial : 0
% 0.14/0.41 # ...subsumed : 5
% 0.14/0.41 # ...remaining for further processing : 158
% 0.14/0.41 # Other redundant clauses eliminated : 1
% 0.14/0.41 # Clauses deleted for lack of memory : 0
% 0.14/0.41 # Backward-subsumed : 2
% 0.14/0.41 # Backward-rewritten : 4
% 0.14/0.41 # Generated clauses : 364
% 0.14/0.41 # ...of the previous two non-redundant : 342
% 0.14/0.41 # ...aggressively subsumed : 0
% 0.14/0.41 # Contextual simplify-reflections : 1
% 0.14/0.41 # Paramodulations : 363
% 0.14/0.41 # Factorizations : 0
% 0.14/0.41 # NegExts : 0
% 0.14/0.41 # Equation resolutions : 1
% 0.14/0.41 # Total rewrite steps : 127
% 0.14/0.41 # Propositional unsat checks : 0
% 0.14/0.41 # Propositional check models : 0
% 0.14/0.41 # Propositional check unsatisfiable : 0
% 0.14/0.41 # Propositional clauses : 0
% 0.14/0.41 # Propositional clauses after purity: 0
% 0.14/0.41 # Propositional unsat core size : 0
% 0.14/0.41 # Propositional preprocessing time : 0.000
% 0.14/0.41 # Propositional encoding time : 0.000
% 0.14/0.41 # Propositional solver time : 0.000
% 0.14/0.41 # Success case prop preproc time : 0.000
% 0.14/0.41 # Success case prop encoding time : 0.000
% 0.14/0.41 # Success case prop solver time : 0.000
% 0.14/0.41 # Current number of processed clauses : 151
% 0.14/0.41 # Positive orientable unit clauses : 30
% 0.14/0.41 # Positive unorientable unit clauses: 0
% 0.14/0.41 # Negative unit clauses : 5
% 0.14/0.41 # Non-unit-clauses : 116
% 0.14/0.41 # Current number of unprocessed clauses: 317
% 0.14/0.41 # ...number of literals in the above : 813
% 0.14/0.41 # Current number of archived formulas : 0
% 0.14/0.41 # Current number of archived clauses : 6
% 0.14/0.41 # Clause-clause subsumption calls (NU) : 5502
% 0.14/0.41 # Rec. Clause-clause subsumption calls : 1639
% 0.14/0.41 # Non-unit clause-clause subsumptions : 5
% 0.14/0.41 # Unit Clause-clause subsumption calls : 76
% 0.14/0.41 # Rewrite failures with RHS unbound : 0
% 0.14/0.41 # BW rewrite match attempts : 1
% 0.14/0.41 # BW rewrite match successes : 1
% 0.14/0.41 # Condensation attempts : 0
% 0.14/0.41 # Condensation successes : 0
% 0.14/0.41 # Termbank termtop insertions : 11764
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.015 s
% 0.14/0.41 # System time : 0.004 s
% 0.14/0.41 # Total time : 0.018 s
% 0.14/0.41 # Maximum resident set size: 2132 pages
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.056 s
% 0.14/0.41 # System time : 0.011 s
% 0.14/0.41 # Total time : 0.067 s
% 0.14/0.41 # Maximum resident set size: 1736 pages
% 0.14/0.41 % E---3.1 exiting
%------------------------------------------------------------------------------