TSTP Solution File: TOP028+4 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : TOP028+4 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:36 EDT 2023
% Result : Theorem 56.08s 13.01s
% Output : CNFRefutation 56.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 34 ( 7 unt; 0 def)
% Number of atoms : 134 ( 0 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 167 ( 67 ~; 56 |; 29 &)
% ( 2 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 57 ( 4 sgn; 33 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t10_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) ) ),
file('/export/starexec/sandbox/tmp/tmp.6nxgKO6s9I/E---3.1_4914.p',t10_tsp_2) ).
fof(t9_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_1(X2,X1)
& ! [X3] :
( m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X1)))
=> ~ ( r1_tarski(X2,X3)
& v1_tsp_2(X3,X1) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6nxgKO6s9I/E---3.1_4914.p',t9_tsp_2) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( r2_hidden(X1,X2)
& v1_xboole_0(X2) ),
file('/export/starexec/sandbox/tmp/tmp.6nxgKO6s9I/E---3.1_4914.p',t7_boole) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( r1_tarski(X1,X2)
<=> ! [X3] :
( r2_hidden(X3,X1)
=> r2_hidden(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.6nxgKO6s9I/E---3.1_4914.p',d3_tarski) ).
fof(t13_tsp_1,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ! [X2] :
( ( v1_xboole_0(X2)
& m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) )
=> v1_tsp_1(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.6nxgKO6s9I/E---3.1_4914.p',t13_tsp_1) ).
fof(t3_subset,axiom,
! [X1,X2] :
( m1_subset_1(X1,k1_zfmisc_1(X2))
<=> r1_tarski(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.6nxgKO6s9I/E---3.1_4914.p',t3_subset) ).
fof(fc1_xboole_0,axiom,
v1_xboole_0(k1_xboole_0),
file('/export/starexec/sandbox/tmp/tmp.6nxgKO6s9I/E---3.1_4914.p',fc1_xboole_0) ).
fof(c_0_7,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) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t10_tsp_2])]) ).
fof(c_0_8,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_1(X2,X1)
& ! [X3] :
( m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X1)))
=> ~ ( r1_tarski(X2,X3)
& v1_tsp_2(X3,X1) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[t9_tsp_2]) ).
fof(c_0_9,plain,
! [X884,X885] :
( ~ r2_hidden(X884,X885)
| ~ v1_xboole_0(X885) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])]) ).
fof(c_0_10,plain,
! [X128,X129,X130,X131,X132] :
( ( ~ r1_tarski(X128,X129)
| ~ r2_hidden(X130,X128)
| r2_hidden(X130,X129) )
& ( r2_hidden(esk15_2(X131,X132),X131)
| r1_tarski(X131,X132) )
& ( ~ r2_hidden(esk15_2(X131,X132),X132)
| r1_tarski(X131,X132) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_tarski])])])])])]) ).
fof(c_0_11,negated_conjecture,
! [X53] :
( ~ v3_struct_0(esk1_0)
& v2_pre_topc(esk1_0)
& l1_pre_topc(esk1_0)
& ( ~ m1_subset_1(X53,k1_zfmisc_1(u1_struct_0(esk1_0)))
| ~ v1_tsp_2(X53,esk1_0) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
fof(c_0_12,plain,
! [X88,X89] :
( ( m1_subset_1(esk5_2(X88,X89),k1_zfmisc_1(u1_struct_0(X88)))
| ~ v1_tsp_1(X89,X88)
| ~ m1_subset_1(X89,k1_zfmisc_1(u1_struct_0(X88)))
| v3_struct_0(X88)
| ~ v2_pre_topc(X88)
| ~ l1_pre_topc(X88) )
& ( r1_tarski(X89,esk5_2(X88,X89))
| ~ v1_tsp_1(X89,X88)
| ~ m1_subset_1(X89,k1_zfmisc_1(u1_struct_0(X88)))
| v3_struct_0(X88)
| ~ v2_pre_topc(X88)
| ~ l1_pre_topc(X88) )
& ( v1_tsp_2(esk5_2(X88,X89),X88)
| ~ v1_tsp_1(X89,X88)
| ~ m1_subset_1(X89,k1_zfmisc_1(u1_struct_0(X88)))
| v3_struct_0(X88)
| ~ v2_pre_topc(X88)
| ~ l1_pre_topc(X88) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])]) ).
fof(c_0_13,plain,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ! [X2] :
( ( v1_xboole_0(X2)
& m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) )
=> v1_tsp_1(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[t13_tsp_1]) ).
fof(c_0_14,plain,
! [X180,X181] :
( ( ~ m1_subset_1(X180,k1_zfmisc_1(X181))
| r1_tarski(X180,X181) )
& ( ~ r1_tarski(X180,X181)
| m1_subset_1(X180,k1_zfmisc_1(X181)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])]) ).
cnf(c_0_15,plain,
( ~ r2_hidden(X1,X2)
| ~ v1_xboole_0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( r2_hidden(esk15_2(X1,X2),X1)
| r1_tarski(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
( ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(esk1_0)))
| ~ v1_tsp_2(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( v1_tsp_2(esk5_2(X1,X2),X1)
| v3_struct_0(X1)
| ~ v1_tsp_1(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_12]) ).
cnf(c_0_19,negated_conjecture,
v2_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,negated_conjecture,
l1_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_22,plain,
! [X286,X287] :
( v3_struct_0(X286)
| ~ v2_pre_topc(X286)
| ~ l1_pre_topc(X286)
| ~ v1_xboole_0(X287)
| ~ m1_subset_1(X287,k1_zfmisc_1(u1_struct_0(X286)))
| v1_tsp_1(X287,X286) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
cnf(c_0_23,plain,
( m1_subset_1(X1,k1_zfmisc_1(X2))
| ~ r1_tarski(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,plain,
( r1_tarski(X1,X2)
| ~ v1_xboole_0(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_25,negated_conjecture,
( ~ v1_tsp_1(X1,esk1_0)
| ~ m1_subset_1(esk5_2(esk1_0,X1),k1_zfmisc_1(u1_struct_0(esk1_0)))
| ~ m1_subset_1(X1,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(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]),c_0_21]) ).
cnf(c_0_26,plain,
( m1_subset_1(esk5_2(X1,X2),k1_zfmisc_1(u1_struct_0(X1)))
| v3_struct_0(X1)
| ~ v1_tsp_1(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_12]) ).
cnf(c_0_27,plain,
( v3_struct_0(X1)
| v1_tsp_1(X2,X1)
| ~ v2_pre_topc(X1)
| ~ l1_pre_topc(X1)
| ~ v1_xboole_0(X2)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
( m1_subset_1(X1,k1_zfmisc_1(X2))
| ~ v1_xboole_0(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,negated_conjecture,
( ~ v1_tsp_1(X1,esk1_0)
| ~ m1_subset_1(X1,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(spm,[status(thm)],[c_0_25,c_0_26]),c_0_19]),c_0_20])]),c_0_21]) ).
cnf(c_0_30,plain,
( v1_tsp_1(X1,X2)
| v3_struct_0(X2)
| ~ v2_pre_topc(X2)
| ~ l1_pre_topc(X2)
| ~ v1_xboole_0(X1) ),
inference(csr,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
v1_xboole_0(k1_xboole_0),
inference(split_conjunct,[status(thm)],[fc1_xboole_0]) ).
cnf(c_0_32,negated_conjecture,
~ v1_xboole_0(X1),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_19]),c_0_20])]),c_0_21]),c_0_28]) ).
cnf(c_0_33,plain,
$false,
inference(sr,[status(thm)],[c_0_31,c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : TOP028+4 : TPTP v8.1.2. Released v3.4.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n006.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 19:00:00 EDT 2023
% 0.10/0.31 % CPUTime :
% 4.36/4.62 Running first-order model finding
% 4.36/4.62 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.6nxgKO6s9I/E---3.1_4914.p
% 56.08/13.01 # Version: 3.1pre001
% 56.08/13.01 # Preprocessing class: FMLLMLLLSSSNFFN.
% 56.08/13.01 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 56.08/13.01 # Starting new_bool_3 with 897s (3) cores
% 56.08/13.01 # Starting new_bool_1 with 897s (3) cores
% 56.08/13.01 # Starting sh5l with 299s (1) cores
% 56.08/13.01 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 299s (1) cores
% 56.08/13.01 # new_bool_3 with pid 4991 completed with status 0
% 56.08/13.01 # Result found by new_bool_3
% 56.08/13.01 # Preprocessing class: FMLLMLLLSSSNFFN.
% 56.08/13.01 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 56.08/13.01 # Starting new_bool_3 with 897s (3) cores
% 56.08/13.01 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 56.08/13.01 # Search class: FGHSM-SMLM31-DFFFFFNN
% 56.08/13.01 # Scheduled 6 strats onto 3 cores with 897 seconds (897 total)
% 56.08/13.01 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 518s (1) cores
% 56.08/13.01 # Starting new_bool_3 with 90s (1) cores
% 56.08/13.01 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 81s (1) cores
% 56.08/13.01 # G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 5003 completed with status 0
% 56.08/13.01 # Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 56.08/13.01 # Preprocessing class: FMLLMLLLSSSNFFN.
% 56.08/13.01 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 56.08/13.01 # Starting new_bool_3 with 897s (3) cores
% 56.08/13.01 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 56.08/13.01 # Search class: FGHSM-SMLM31-DFFFFFNN
% 56.08/13.01 # Scheduled 6 strats onto 3 cores with 897 seconds (897 total)
% 56.08/13.01 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 518s (1) cores
% 56.08/13.01 # Starting new_bool_3 with 90s (1) cores
% 56.08/13.01 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 81s (1) cores
% 56.08/13.01 # Preprocessing time : 0.090 s
% 56.08/13.01 # Presaturation interreduction done
% 56.08/13.01
% 56.08/13.01 # Proof found!
% 56.08/13.01 # SZS status Theorem
% 56.08/13.01 # SZS output start CNFRefutation
% See solution above
% 56.08/13.01 # Parsed axioms : 34391
% 56.08/13.01 # Removed by relevancy pruning/SinE : 32848
% 56.08/13.01 # Initial clauses : 3911
% 56.08/13.01 # Removed in clause preprocessing : 134
% 56.08/13.01 # Initial clauses in saturation : 3777
% 56.08/13.01 # Processed clauses : 20628
% 56.08/13.01 # ...of these trivial : 474
% 56.08/13.01 # ...subsumed : 8950
% 56.08/13.01 # ...remaining for further processing : 11204
% 56.08/13.01 # Other redundant clauses eliminated : 368
% 56.08/13.01 # Clauses deleted for lack of memory : 0
% 56.08/13.01 # Backward-subsumed : 538
% 56.08/13.01 # Backward-rewritten : 180
% 56.08/13.01 # Generated clauses : 79653
% 56.08/13.01 # ...of the previous two non-redundant : 71092
% 56.08/13.01 # ...aggressively subsumed : 0
% 56.08/13.01 # Contextual simplify-reflections : 479
% 56.08/13.01 # Paramodulations : 79262
% 56.08/13.01 # Factorizations : 1
% 56.08/13.01 # NegExts : 0
% 56.08/13.01 # Equation resolutions : 380
% 56.08/13.01 # Total rewrite steps : 18851
% 56.08/13.01 # Propositional unsat checks : 2
% 56.08/13.01 # Propositional check models : 1
% 56.08/13.01 # Propositional check unsatisfiable : 0
% 56.08/13.01 # Propositional clauses : 0
% 56.08/13.01 # Propositional clauses after purity: 0
% 56.08/13.01 # Propositional unsat core size : 0
% 56.08/13.01 # Propositional preprocessing time : 0.000
% 56.08/13.01 # Propositional encoding time : 0.097
% 56.08/13.01 # Propositional solver time : 0.094
% 56.08/13.01 # Success case prop preproc time : 0.000
% 56.08/13.01 # Success case prop encoding time : 0.000
% 56.08/13.01 # Success case prop solver time : 0.000
% 56.08/13.01 # Current number of processed clauses : 6782
% 56.08/13.01 # Positive orientable unit clauses : 1125
% 56.08/13.01 # Positive unorientable unit clauses: 4
% 56.08/13.01 # Negative unit clauses : 2139
% 56.08/13.01 # Non-unit-clauses : 3514
% 56.08/13.01 # Current number of unprocessed clauses: 56663
% 56.08/13.01 # ...number of literals in the above : 170425
% 56.08/13.01 # Current number of archived formulas : 0
% 56.08/13.01 # Current number of archived clauses : 4171
% 56.08/13.01 # Clause-clause subsumption calls (NU) : 9977722
% 56.08/13.01 # Rec. Clause-clause subsumption calls : 1579188
% 56.08/13.01 # Non-unit clause-clause subsumptions : 2742
% 56.08/13.01 # Unit Clause-clause subsumption calls : 745738
% 56.08/13.01 # Rewrite failures with RHS unbound : 0
% 56.08/13.01 # BW rewrite match attempts : 493
% 56.08/13.01 # BW rewrite match successes : 208
% 56.08/13.01 # Condensation attempts : 0
% 56.08/13.01 # Condensation successes : 0
% 56.08/13.01 # Termbank termtop insertions : 2392679
% 56.08/13.01
% 56.08/13.01 # -------------------------------------------------
% 56.08/13.01 # User time : 6.374 s
% 56.08/13.01 # System time : 0.186 s
% 56.08/13.01 # Total time : 6.560 s
% 56.08/13.01 # Maximum resident set size: 68628 pages
% 56.08/13.01
% 56.08/13.01 # -------------------------------------------------
% 56.08/13.01 # User time : 19.331 s
% 56.08/13.01 # System time : 0.402 s
% 56.08/13.01 # Total time : 19.732 s
% 56.08/13.01 # Maximum resident set size: 53280 pages
% 56.08/13.01 % E---3.1 exiting
%------------------------------------------------------------------------------