TSTP Solution File: ALG227+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : ALG227+2 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n020.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 : 300s
% WCLimit : 600s
% DateTime : Thu Jul 14 16:50:35 EDT 2022
% Result : Theorem 1.38s 126.56s
% Output : CNFRefutation 1.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 39 ( 16 unt; 0 def)
% Number of atoms : 118 ( 34 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 128 ( 49 ~; 51 |; 12 &)
% ( 3 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-3 aty)
% Number of variables : 55 ( 2 sgn 31 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d5_xboole_0,axiom,
! [X1] :
( v1_xboole_0(X1)
<=> X1 = k1_xboole_0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+2.ax',d5_xboole_0) ).
fof(t51_card_1,axiom,
np__0 = k1_xboole_0,
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+54.ax',t51_card_1) ).
fof(rc1_xboole_0,axiom,
? [X1] : v1_xboole_0(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+2.ax',rc1_xboole_0) ).
fof(fraenkel_a_2_0_closure3,axiom,
! [X1,X2,X3] :
( ( ~ v1_xboole_0(X2)
& m1_pboole(X3,X2) )
=> ( r2_hidden(X1,a_2_0_closure3(X2,X3))
<=> ? [X4] :
( m1_subset_1(X4,X2)
& X1 = X4
& k1_funct_1(X3,X4) != k1_xboole_0 ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fraenkel_a_2_0_closure3) ).
fof(t8_closure3,conjecture,
! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2] :
( m1_pboole(X2,X1)
=> ! [X3] :
( m1_subset_1(X3,X1)
=> ( ~ r2_hidden(X3,k1_closure3(X1,X2))
=> k1_funct_1(X2,X3) = k1_xboole_0 ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t8_closure3) ).
fof(t1_subset,axiom,
! [X1,X2] :
( r2_hidden(X1,X2)
=> m1_subset_1(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+9.ax',t1_subset) ).
fof(t2_subset,axiom,
! [X1,X2] :
( m1_subset_1(X1,X2)
=> ( v1_xboole_0(X2)
| r2_hidden(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+9.ax',t2_subset) ).
fof(d3_closure3,axiom,
! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2] :
( m1_pboole(X2,X1)
=> ! [X3] :
( X3 = k1_closure3(X1,X2)
<=> X3 = a_2_0_closure3(X1,X2) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',d3_closure3) ).
fof(c_0_8,plain,
! [X2,X2] :
( ( ~ v1_xboole_0(X2)
| X2 = k1_xboole_0 )
& ( X2 != k1_xboole_0
| v1_xboole_0(X2) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d5_xboole_0])])])]) ).
cnf(c_0_9,plain,
( X1 = k1_xboole_0
| ~ v1_xboole_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_10,plain,
np__0 = k1_xboole_0,
inference(split_conjunct,[status(thm)],[t51_card_1]) ).
fof(c_0_11,plain,
v1_xboole_0(esk25_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
fof(c_0_12,plain,
! [X5,X6,X7,X9] :
( ( m1_subset_1(esk1337_3(X5,X6,X7),X6)
| ~ r2_hidden(X5,a_2_0_closure3(X6,X7))
| v1_xboole_0(X6)
| ~ m1_pboole(X7,X6) )
& ( X5 = esk1337_3(X5,X6,X7)
| ~ r2_hidden(X5,a_2_0_closure3(X6,X7))
| v1_xboole_0(X6)
| ~ m1_pboole(X7,X6) )
& ( k1_funct_1(X7,esk1337_3(X5,X6,X7)) != k1_xboole_0
| ~ r2_hidden(X5,a_2_0_closure3(X6,X7))
| v1_xboole_0(X6)
| ~ m1_pboole(X7,X6) )
& ( ~ m1_subset_1(X9,X6)
| X5 != X9
| k1_funct_1(X7,X9) = k1_xboole_0
| r2_hidden(X5,a_2_0_closure3(X6,X7))
| v1_xboole_0(X6)
| ~ m1_pboole(X7,X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[fraenkel_a_2_0_closure3])])])])])])])]) ).
cnf(c_0_13,plain,
( X1 = np__0
| ~ v1_xboole_0(X1) ),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
v1_xboole_0(esk25_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,negated_conjecture,
~ ! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2] :
( m1_pboole(X2,X1)
=> ! [X3] :
( m1_subset_1(X3,X1)
=> ( ~ r2_hidden(X3,k1_closure3(X1,X2))
=> k1_funct_1(X2,X3) = k1_xboole_0 ) ) ) ),
inference(assume_negation,[status(cth)],[t8_closure3]) ).
cnf(c_0_16,plain,
( v1_xboole_0(X2)
| r2_hidden(X3,a_2_0_closure3(X2,X1))
| k1_funct_1(X1,X4) = k1_xboole_0
| ~ m1_pboole(X1,X2)
| X3 != X4
| ~ m1_subset_1(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
np__0 = esk25_0,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_18,plain,
! [X3,X4] :
( ~ r2_hidden(X3,X4)
| m1_subset_1(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])]) ).
fof(c_0_19,negated_conjecture,
( ~ v1_xboole_0(esk1343_0)
& m1_pboole(esk1344_0,esk1343_0)
& m1_subset_1(esk1345_0,esk1343_0)
& ~ r2_hidden(esk1345_0,k1_closure3(esk1343_0,esk1344_0))
& k1_funct_1(esk1344_0,esk1345_0) != k1_xboole_0 ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_15])])])])])]) ).
cnf(c_0_20,plain,
( k1_funct_1(X1,X2) = esk25_0
| v1_xboole_0(X3)
| r2_hidden(X2,a_2_0_closure3(X3,X1))
| ~ m1_pboole(X1,X3)
| ~ m1_subset_1(X2,X3) ),
inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_10])]),c_0_17]) ).
cnf(c_0_21,plain,
( m1_subset_1(X1,X2)
| ~ r2_hidden(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_22,plain,
! [X3,X4] :
( ~ m1_subset_1(X3,X4)
| v1_xboole_0(X4)
| r2_hidden(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
cnf(c_0_23,negated_conjecture,
k1_funct_1(esk1344_0,esk1345_0) != k1_xboole_0,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
( k1_funct_1(X1,X2) = esk25_0
| v1_xboole_0(X3)
| r2_hidden(X2,a_2_0_closure3(X3,X1))
| ~ m1_pboole(X1,X3)
| ~ r2_hidden(X2,X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
m1_pboole(esk1344_0,esk1343_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,negated_conjecture,
~ v1_xboole_0(esk1343_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
( r2_hidden(X1,X2)
| v1_xboole_0(X2)
| ~ m1_subset_1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,negated_conjecture,
m1_subset_1(esk1345_0,esk1343_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,negated_conjecture,
k1_funct_1(esk1344_0,esk1345_0) != np__0,
inference(rw,[status(thm)],[c_0_23,c_0_10]) ).
fof(c_0_30,plain,
! [X4,X5,X6,X6] :
( ( X6 != k1_closure3(X4,X5)
| X6 = a_2_0_closure3(X4,X5)
| ~ m1_pboole(X5,X4)
| v1_xboole_0(X4) )
& ( X6 != a_2_0_closure3(X4,X5)
| X6 = k1_closure3(X4,X5)
| ~ m1_pboole(X5,X4)
| v1_xboole_0(X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[d3_closure3])])])])])])]) ).
cnf(c_0_31,negated_conjecture,
( k1_funct_1(esk1344_0,X1) = esk25_0
| r2_hidden(X1,a_2_0_closure3(esk1343_0,esk1344_0))
| ~ r2_hidden(X1,esk1343_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_32,negated_conjecture,
r2_hidden(esk1345_0,esk1343_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_26]) ).
cnf(c_0_33,negated_conjecture,
k1_funct_1(esk1344_0,esk1345_0) != esk25_0,
inference(rw,[status(thm)],[c_0_29,c_0_17]) ).
cnf(c_0_34,plain,
( v1_xboole_0(X1)
| X3 = a_2_0_closure3(X1,X2)
| ~ m1_pboole(X2,X1)
| X3 != k1_closure3(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,negated_conjecture,
r2_hidden(esk1345_0,a_2_0_closure3(esk1343_0,esk1344_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_36,plain,
( a_2_0_closure3(X1,X2) = k1_closure3(X1,X2)
| v1_xboole_0(X1)
| ~ m1_pboole(X2,X1) ),
inference(er,[status(thm)],[c_0_34]) ).
cnf(c_0_37,negated_conjecture,
~ r2_hidden(esk1345_0,k1_closure3(esk1343_0,esk1344_0)),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_25])]),c_0_37]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ALG227+2 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Wed Jun 8 02:02:22 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.63/23.65 eprover: CPU time limit exceeded, terminating
% 0.63/23.65 eprover: CPU time limit exceeded, terminating
% 0.63/23.66 eprover: CPU time limit exceeded, terminating
% 0.63/23.66 eprover: CPU time limit exceeded, terminating
% 0.80/46.67 eprover: CPU time limit exceeded, terminating
% 0.80/46.67 eprover: CPU time limit exceeded, terminating
% 0.80/46.68 eprover: CPU time limit exceeded, terminating
% 0.80/46.70 eprover: CPU time limit exceeded, terminating
% 0.97/69.69 eprover: CPU time limit exceeded, terminating
% 0.97/69.70 eprover: CPU time limit exceeded, terminating
% 0.97/69.71 eprover: CPU time limit exceeded, terminating
% 0.97/69.71 eprover: CPU time limit exceeded, terminating
% 1.14/92.72 eprover: CPU time limit exceeded, terminating
% 1.14/92.72 eprover: CPU time limit exceeded, terminating
% 1.14/92.73 eprover: CPU time limit exceeded, terminating
% 1.14/92.73 eprover: CPU time limit exceeded, terminating
% 1.30/115.74 eprover: CPU time limit exceeded, terminating
% 1.30/115.75 eprover: CPU time limit exceeded, terminating
% 1.30/115.75 eprover: CPU time limit exceeded, terminating
% 1.30/115.76 eprover: CPU time limit exceeded, terminating
% 1.38/126.56 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 1.38/126.56
% 1.38/126.56 # Failure: Resource limit exceeded (time)
% 1.38/126.56 # OLD status Res
% 1.38/126.56 # Preprocessing time : 0.867 s
% 1.38/126.56 # Running protocol protocol_eprover_f6eb5f7f05126ea361481ae651a4823314e3d740 for 23 seconds:
% 1.38/126.56
% 1.38/126.56 # Failure: Resource limit exceeded (time)
% 1.38/126.56 # OLD status Res
% 1.38/126.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 1.38/126.56 # Preprocessing time : 0.110 s
% 1.38/126.56 # Running protocol protocol_eprover_a172c605141d0894bf6fdc293a5220c6c2a32117 for 23 seconds:
% 1.38/126.56
% 1.38/126.56 # Failure: Resource limit exceeded (time)
% 1.38/126.56 # OLD status Res
% 1.38/126.56 # Preprocessing time : 0.845 s
% 1.38/126.56 # Running protocol protocol_eprover_f8b0f932169414d689b89e2a8b18d4600533b975 for 23 seconds:
% 1.38/126.56
% 1.38/126.56 # Failure: Resource limit exceeded (time)
% 1.38/126.56 # OLD status Res
% 1.38/126.56 # Preprocessing time : 0.819 s
% 1.38/126.56 # Running protocol protocol_eprover_fc511518e5f98a6b2c7baef820b71b6d1abb3e55 for 23 seconds:
% 1.38/126.56
% 1.38/126.56 # Failure: Resource limit exceeded (time)
% 1.38/126.56 # OLD status Res
% 1.38/126.56 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,02,80,1.0)
% 1.38/126.56 # Preprocessing time : 0.168 s
% 1.38/126.56 # Running protocol protocol_eprover_95b56b3f38545d2cfee43b45856d192a814b65d5 for 23 seconds:
% 1.38/126.56 # Preprocessing time : 0.761 s
% 1.38/126.56
% 1.38/126.56 # Proof found!
% 1.38/126.56 # SZS status Theorem
% 1.38/126.56 # SZS output start CNFRefutation
% See solution above
% 1.38/126.56 # Proof object total steps : 39
% 1.38/126.56 # Proof object clause steps : 23
% 1.38/126.56 # Proof object formula steps : 16
% 1.38/126.56 # Proof object conjectures : 14
% 1.38/126.56 # Proof object clause conjectures : 11
% 1.38/126.56 # Proof object formula conjectures : 3
% 1.38/126.56 # Proof object initial clauses used : 12
% 1.38/126.56 # Proof object initial formulas used : 8
% 1.38/126.56 # Proof object generating inferences : 7
% 1.38/126.56 # Proof object simplifying inferences : 13
% 1.38/126.56 # Training examples: 0 positive, 0 negative
% 1.38/126.56 # Parsed axioms : 4731
% 1.38/126.56 # Removed by relevancy pruning/SinE : 0
% 1.38/126.56 # Initial clauses : 11248
% 1.38/126.56 # Removed in clause preprocessing : 896
% 1.38/126.56 # Initial clauses in saturation : 10352
% 1.38/126.56 # Processed clauses : 11242
% 1.38/126.56 # ...of these trivial : 122
% 1.38/126.56 # ...subsumed : 722
% 1.38/126.56 # ...remaining for further processing : 10398
% 1.38/126.56 # Other redundant clauses eliminated : 1128
% 1.38/126.56 # Clauses deleted for lack of memory : 194349
% 1.38/126.56 # Backward-subsumed : 18
% 1.38/126.56 # Backward-rewritten : 3202
% 1.38/126.56 # Generated clauses : 280393
% 1.38/126.56 # ...of the previous two non-trivial : 274881
% 1.38/126.56 # Contextual simplify-reflections : 0
% 1.38/126.56 # Paramodulations : 278809
% 1.38/126.56 # Factorizations : 39
% 1.38/126.56 # Equation resolutions : 1549
% 1.38/126.56 # Current number of processed clauses : 7118
% 1.38/126.56 # Positive orientable unit clauses : 702
% 1.38/126.56 # Positive unorientable unit clauses: 3
% 1.38/126.56 # Negative unit clauses : 179
% 1.38/126.56 # Non-unit-clauses : 6234
% 1.38/126.56 # Current number of unprocessed clauses: 55383
% 1.38/126.56 # ...number of literals in the above : 264910
% 1.38/126.56 # Current number of archived formulas : 0
% 1.38/126.56 # Current number of archived clauses : 3245
% 1.38/126.56 # Clause-clause subsumption calls (NU) : 8397854
% 1.38/126.56 # Rec. Clause-clause subsumption calls : 1112385
% 1.38/126.56 # Non-unit clause-clause subsumptions : 589
% 1.38/126.56 # Unit Clause-clause subsumption calls : 443111
% 1.38/126.56 # Rewrite failures with RHS unbound : 60
% 1.38/126.56 # BW rewrite match attempts : 3522
% 1.38/126.56 # BW rewrite match successes : 231
% 1.38/126.56 # Condensation attempts : 0
% 1.38/126.56 # Condensation successes : 0
% 1.38/126.56 # Termbank termtop insertions : 9568819
% 1.38/126.56
% 1.38/126.56 # -------------------------------------------------
% 1.38/126.56 # User time : 10.438 s
% 1.38/126.56 # System time : 0.151 s
% 1.38/126.56 # Total time : 10.589 s
% 1.38/126.56 # Maximum resident set size: 177876 pages
%------------------------------------------------------------------------------