TSTP Solution File: TOP027+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : TOP027+3 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:35 EDT 2023
% Result : Theorem 12.35s 3.10s
% Output : CNFRefutation 12.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 9 unt; 0 def)
% Number of atoms : 85 ( 8 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 96 ( 34 ~; 25 |; 17 &)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 30 ( 0 sgn; 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t8_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)))
=> ( v1_tsp_2(X2,X1)
=> ! [X3] :
( m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X1)))
=> k1_tops_1(X1,X3) = k3_tex_4(X1,k5_subset_1(u1_struct_0(X1),X2,k1_tops_1(X1,X3))) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.XC9hRgby10/E---3.1_12955.p',t8_tsp_2) ).
fof(t6_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)
=> ! [X3] :
( m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X1)))
=> ( v3_pre_topc(X3,X1)
=> X3 = k3_tex_4(X1,k5_subset_1(u1_struct_0(X1),X2,X3)) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.XC9hRgby10/E---3.1_12955.p',t6_tsp_2) ).
fof(fc6_tops_1,axiom,
! [X1,X2] :
( ( v2_pre_topc(X1)
& l1_pre_topc(X1)
& m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) )
=> v3_pre_topc(k1_tops_1(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.XC9hRgby10/E---3.1_12955.p',fc6_tops_1) ).
fof(dt_k1_tops_1,axiom,
! [X1,X2] :
( ( l1_pre_topc(X1)
& m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) )
=> m1_subset_1(k1_tops_1(X1,X2),k1_zfmisc_1(u1_struct_0(X1))) ),
file('/export/starexec/sandbox2/tmp/tmp.XC9hRgby10/E---3.1_12955.p',dt_k1_tops_1) ).
fof(c_0_4,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)))
=> ( v1_tsp_2(X2,X1)
=> ! [X3] :
( m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X1)))
=> k1_tops_1(X1,X3) = k3_tex_4(X1,k5_subset_1(u1_struct_0(X1),X2,k1_tops_1(X1,X3))) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t8_tsp_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)
=> ! [X3] :
( m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X1)))
=> ( v3_pre_topc(X3,X1)
=> X3 = k3_tex_4(X1,k5_subset_1(u1_struct_0(X1),X2,X3)) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[t6_tsp_2]) ).
fof(c_0_6,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)))
& v1_tsp_2(esk2_0,esk1_0)
& m1_subset_1(esk3_0,k1_zfmisc_1(u1_struct_0(esk1_0)))
& k1_tops_1(esk1_0,esk3_0) != k3_tex_4(esk1_0,k5_subset_1(u1_struct_0(esk1_0),esk2_0,k1_tops_1(esk1_0,esk3_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,plain,
! [X245,X246,X247] :
( v3_struct_0(X245)
| ~ v2_pre_topc(X245)
| ~ l1_pre_topc(X245)
| ~ m1_subset_1(X246,k1_zfmisc_1(u1_struct_0(X245)))
| ~ v1_tsp_2(X246,X245)
| ~ m1_subset_1(X247,k1_zfmisc_1(u1_struct_0(X245)))
| ~ v3_pre_topc(X247,X245)
| X247 = k3_tex_4(X245,k5_subset_1(u1_struct_0(X245),X246,X247)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_8,negated_conjecture,
k1_tops_1(esk1_0,esk3_0) != k3_tex_4(esk1_0,k5_subset_1(u1_struct_0(esk1_0),esk2_0,k1_tops_1(esk1_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( v3_struct_0(X1)
| X3 = k3_tex_4(X1,k5_subset_1(u1_struct_0(X1),X2,X3))
| ~ v2_pre_topc(X1)
| ~ l1_pre_topc(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ v1_tsp_2(X2,X1)
| ~ m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X1)))
| ~ v3_pre_topc(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
v1_tsp_2(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
v2_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
l1_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
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_6]) ).
cnf(c_0_14,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_15,plain,
! [X119,X120] :
( ~ v2_pre_topc(X119)
| ~ l1_pre_topc(X119)
| ~ m1_subset_1(X120,k1_zfmisc_1(u1_struct_0(X119)))
| v3_pre_topc(k1_tops_1(X119,X120),X119) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc6_tops_1])]) ).
cnf(c_0_16,negated_conjecture,
( ~ v3_pre_topc(k1_tops_1(esk1_0,esk3_0),esk1_0)
| ~ m1_subset_1(k1_tops_1(esk1_0,esk3_0),k1_zfmisc_1(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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11]),c_0_12]),c_0_13])]),c_0_14]) ).
cnf(c_0_17,plain,
( v3_pre_topc(k1_tops_1(X1,X2),X1)
| ~ v2_pre_topc(X1)
| ~ l1_pre_topc(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,negated_conjecture,
m1_subset_1(esk3_0,k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_19,plain,
! [X155,X156] :
( ~ l1_pre_topc(X155)
| ~ m1_subset_1(X156,k1_zfmisc_1(u1_struct_0(X155)))
| m1_subset_1(k1_tops_1(X155,X156),k1_zfmisc_1(u1_struct_0(X155))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k1_tops_1])]) ).
cnf(c_0_20,negated_conjecture,
~ m1_subset_1(k1_tops_1(esk1_0,esk3_0),k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_11]),c_0_12]),c_0_18])]) ).
cnf(c_0_21,plain,
( m1_subset_1(k1_tops_1(X1,X2),k1_zfmisc_1(u1_struct_0(X1)))
| ~ l1_pre_topc(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_12]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : TOP027+3 : TPTP v8.1.2. Released v3.4.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n026.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Oct 2 19:29:01 EDT 2023
% 0.20/0.34 % CPUTime :
% 1.09/1.25 Running first-order model finding
% 1.09/1.25 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.XC9hRgby10/E---3.1_12955.p
% 12.35/3.10 # Version: 3.1pre001
% 12.35/3.10 # Preprocessing class: FMLLSMLLSSSNFFN.
% 12.35/3.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.35/3.10 # Starting new_bool_3 with 900s (3) cores
% 12.35/3.10 # Starting new_bool_1 with 900s (3) cores
% 12.35/3.10 # Starting sh5l with 300s (1) cores
% 12.35/3.10 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 12.35/3.10 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 13111 completed with status 0
% 12.35/3.10 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 12.35/3.10 # Preprocessing class: FMLLSMLLSSSNFFN.
% 12.35/3.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.35/3.10 # Starting new_bool_3 with 900s (3) cores
% 12.35/3.10 # Starting new_bool_1 with 900s (3) cores
% 12.35/3.10 # Starting sh5l with 300s (1) cores
% 12.35/3.10 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 12.35/3.10 # SinE strategy is gf120_gu_R02_F100_L20000
% 12.35/3.10 # Search class: FGHSM-SMLM31-MFFFFFNN
% 12.35/3.10 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 12.35/3.10 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 163s (1) cores
% 12.35/3.10 # C07_19_nc_SAT001_MinMin_p005000_rr with pid 13112 completed with status 0
% 12.35/3.10 # Result found by C07_19_nc_SAT001_MinMin_p005000_rr
% 12.35/3.10 # Preprocessing class: FMLLSMLLSSSNFFN.
% 12.35/3.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.35/3.10 # Starting new_bool_3 with 900s (3) cores
% 12.35/3.10 # Starting new_bool_1 with 900s (3) cores
% 12.35/3.10 # Starting sh5l with 300s (1) cores
% 12.35/3.10 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 12.35/3.10 # SinE strategy is gf120_gu_R02_F100_L20000
% 12.35/3.10 # Search class: FGHSM-SMLM31-MFFFFFNN
% 12.35/3.10 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 12.35/3.10 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 163s (1) cores
% 12.35/3.10 # Preprocessing time : 0.042 s
% 12.35/3.10 # Presaturation interreduction done
% 12.35/3.10
% 12.35/3.10 # Proof found!
% 12.35/3.10 # SZS status Theorem
% 12.35/3.10 # SZS output start CNFRefutation
% See solution above
% 12.35/3.10 # Parsed axioms : 13483
% 12.35/3.10 # Removed by relevancy pruning/SinE : 12791
% 12.35/3.10 # Initial clauses : 1569
% 12.35/3.10 # Removed in clause preprocessing : 34
% 12.35/3.10 # Initial clauses in saturation : 1535
% 12.35/3.10 # Processed clauses : 11597
% 12.35/3.10 # ...of these trivial : 140
% 12.35/3.10 # ...subsumed : 6425
% 12.35/3.10 # ...remaining for further processing : 5032
% 12.35/3.10 # Other redundant clauses eliminated : 151
% 12.35/3.10 # Clauses deleted for lack of memory : 0
% 12.35/3.10 # Backward-subsumed : 165
% 12.35/3.10 # Backward-rewritten : 88
% 12.35/3.10 # Generated clauses : 38503
% 12.35/3.10 # ...of the previous two non-redundant : 34212
% 12.35/3.10 # ...aggressively subsumed : 0
% 12.35/3.10 # Contextual simplify-reflections : 186
% 12.35/3.10 # Paramodulations : 38282
% 12.35/3.10 # Factorizations : 2
% 12.35/3.10 # NegExts : 0
% 12.35/3.10 # Equation resolutions : 164
% 12.35/3.10 # Total rewrite steps : 9667
% 12.35/3.10 # Propositional unsat checks : 1
% 12.35/3.10 # Propositional check models : 0
% 12.35/3.10 # Propositional check unsatisfiable : 0
% 12.35/3.10 # Propositional clauses : 0
% 12.35/3.10 # Propositional clauses after purity: 0
% 12.35/3.10 # Propositional unsat core size : 0
% 12.35/3.10 # Propositional preprocessing time : 0.000
% 12.35/3.10 # Propositional encoding time : 0.035
% 12.35/3.10 # Propositional solver time : 0.028
% 12.35/3.10 # Success case prop preproc time : 0.000
% 12.35/3.10 # Success case prop encoding time : 0.000
% 12.35/3.10 # Success case prop solver time : 0.000
% 12.35/3.10 # Current number of processed clauses : 3207
% 12.35/3.10 # Positive orientable unit clauses : 370
% 12.35/3.10 # Positive unorientable unit clauses: 3
% 12.35/3.10 # Negative unit clauses : 429
% 12.35/3.10 # Non-unit-clauses : 2405
% 12.35/3.10 # Current number of unprocessed clauses: 25336
% 12.35/3.10 # ...number of literals in the above : 102562
% 12.35/3.10 # Current number of archived formulas : 0
% 12.35/3.10 # Current number of archived clauses : 1723
% 12.35/3.10 # Clause-clause subsumption calls (NU) : 3235560
% 12.35/3.10 # Rec. Clause-clause subsumption calls : 810186
% 12.35/3.10 # Non-unit clause-clause subsumptions : 2686
% 12.35/3.10 # Unit Clause-clause subsumption calls : 102995
% 12.35/3.10 # Rewrite failures with RHS unbound : 3
% 12.35/3.10 # BW rewrite match attempts : 306
% 12.35/3.10 # BW rewrite match successes : 104
% 12.35/3.10 # Condensation attempts : 0
% 12.35/3.10 # Condensation successes : 0
% 12.35/3.10 # Termbank termtop insertions : 1101594
% 12.35/3.10
% 12.35/3.10 # -------------------------------------------------
% 12.35/3.10 # User time : 1.478 s
% 12.35/3.10 # System time : 0.071 s
% 12.35/3.10 # Total time : 1.549 s
% 12.35/3.10 # Maximum resident set size: 26144 pages
% 12.35/3.10
% 12.35/3.10 # -------------------------------------------------
% 12.35/3.10 # User time : 1.696 s
% 12.35/3.10 # System time : 0.083 s
% 12.35/3.10 # Total time : 1.780 s
% 12.35/3.10 # Maximum resident set size: 19812 pages
% 12.35/3.10 % E---3.1 exiting
%------------------------------------------------------------------------------