%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEV629+1 : TPTP v9.3.0. Released v9.3.0. % Transfm : none % Format : tptp:raw % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % Computer : n017.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 : 300s % DateTime : Tue May 5 06:52:00 PM UTC 2026 % Result : Theorem 0.30s 0.57s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.13 % Problem : SEV629+1 : TPTP v9.3.0. Released v9.3.0. % 0.10/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.18/0.36 % Computer : n017.cluster.edu % 0.18/0.36 % Model : x86_64 x86_64 % 0.18/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.18/0.36 % Memory : 8042.1875MB % 0.18/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.18/0.36 % CPULimit : 300 % 0.18/0.36 % WCLimit : 300 % 0.18/0.36 % DateTime : Tue May 5 06:19:12 EDT 2026 % 0.18/0.36 % CPUTime : % 0.30/0.56 # SinE strategy is gf120_h_gu_RUU_F100_L00500 % 0.30/0.56 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.30/0.56 # and selection function SelectComplexExceptUniqMaxHorn. % 0.30/0.56 # % 0.30/0.56 # Presaturation interreduction done % 0.30/0.56 # Number of axioms: 28 Number of unprocessed: 28 % 0.30/0.56 # Tableaux proof search. % 0.30/0.56 # APR header successfully linked. % 0.30/0.56 # Hello from C++ % 0.30/0.57 # The folding up rule is enabled... % 0.30/0.57 # Local unification is enabled... % 0.30/0.57 # Any saturation attempts will use folding labels... % 0.30/0.57 # 28 beginning clauses after preprocessing and clausification % 0.30/0.57 # Creating start rules for all 1 conjectures. % 0.30/0.57 # There are 1 start rule candidates: % 0.30/0.57 # Found 3 unit axioms. % 0.30/0.57 # 1 start rule tableaux created. % 0.30/0.57 # 25 extension rule candidate clauses % 0.30/0.57 # 3 unit axiom clauses % 0.30/0.57 % 0.30/0.57 # Requested 8, 32 cores available to the main process. % 0.30/0.57 # There are not enough tableaux to fork, creating more from the initial 1 % 0.30/0.57 # There were 1 total branch saturation attempts. % 0.30/0.57 # There were 0 of these attempts blocked. % 0.30/0.57 # There were 0 deferred branch saturation attempts. % 0.30/0.57 # There were 0 free duplicated saturations. % 0.30/0.57 # There were 1 total successful branch saturations. % 0.30/0.57 # There were 0 successful branch saturations in interreduction. % 0.30/0.57 # There were 0 successful branch saturations on the branch. % 0.30/0.57 # There were 1 successful branch saturations after the branch. % 0.30/0.57 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.30/0.57 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.30/0.57 # Begin clausification derivation % 0.30/0.57 % 0.30/0.57 # End clausification derivation % 0.30/0.57 # Begin listing active clauses obtained from FOF to CNF conversion % 0.30/0.57 cnf(i_0_6, plain, (cType___24t(cA))). % 0.30/0.57 cnf(i_0_9, plain, (c_24__type__32360___24t(cHahnSets_2eset__subset))). % 0.30/0.57 cnf(i_0_1, negated_conjecture, (~cCoq_2eRelations_2eRelation__Definitions_2ereflexive___24a2(c_24__type__35378,happ(cHahnSets_2eset__subset,cA)))). % 0.30/0.57 cnf(i_0_8, plain, (t(X1,c_24__type__35378)|~c_24__type__35378___24t(X1))). % 0.30/0.57 cnf(i_0_7, plain, (c_24__type__35378___24t(X1)|~t(X1,c_24__type__35378))). % 0.30/0.57 cnf(i_0_15, plain, (c_24__type__32360___24t(X1)|cType___24t(esk2_1(X1)))). % 0.30/0.57 cnf(i_0_14, plain, (c_24__type__32360___24t(X1)|c_24__type__36___24t(esk2_1(X1),esk3_1(X1)))). % 0.30/0.57 cnf(i_0_40, plain, (c_24__type__36___24t(X1,X2)|~cProp___24t(happ(X2,esk6_2(X1,X2))))). % 0.30/0.57 cnf(i_0_17, plain, (cHahnSets_2eset__subset___24a3(X1,X2,X3)|~p(happ(X3,esk5_3(X1,X2,X3))))). % 0.30/0.57 cnf(i_0_13, plain, (c_24__type__32360___24t(X1)|c_24__type__36___24t(esk2_1(X1),esk4_1(X1)))). % 0.30/0.57 cnf(i_0_11, plain, (cHahnSets_2eset__subset___24a3(X1,X2,X3)|~p(happ(happ(happ(cHahnSets_2eset__subset,X1),X2),X3)))). % 0.30/0.57 cnf(i_0_3, plain, (cCoq_2eRelations_2eRelation__Definitions_2ereflexive___24a2(X1,X2)|t(esk1_2(X1,X2),X1))). % 0.30/0.57 cnf(i_0_10, plain, (p(happ(happ(happ(cHahnSets_2eset__subset,X1),X2),X3))|~cHahnSets_2eset__subset___24a3(X1,X2,X3))). % 0.30/0.57 cnf(i_0_2, plain, (cCoq_2eRelations_2eRelation__Definitions_2ereflexive___24a2(X1,X2)|~p(happ(happ(X2,esk1_2(X1,X2)),esk1_2(X1,X2))))). % 0.30/0.57 cnf(i_0_12, plain, (c_24__type__32360___24t(X1)|~cProp___24t(happ(happ(happ(X1,esk2_1(X1)),esk3_1(X1)),esk4_1(X1))))). % 0.30/0.57 cnf(i_0_41, plain, (c_24__type__36___24t(X1,X2)|t(esk6_2(X1,X2),X1))). % 0.30/0.57 cnf(i_0_42, plain, (cProp___24t(happ(X1,X2))|~c_24__type__36___24t(X3,X1)|~t(X2,X3))). % 0.30/0.57 cnf(i_0_19, plain, (cHahnSets_2eset__subset___24a3(X1,X2,X3)|t(esk5_3(X1,X2,X3),X1))). % 0.30/0.57 cnf(i_0_4, plain, (p(happ(happ(X1,X2),X2))|~cCoq_2eRelations_2eRelation__Definitions_2ereflexive___24a2(X3,X1)|~t(X2,X3))). % 0.30/0.57 cnf(i_0_20, plain, (p(happ(X1,X2))|~cHahnSets_2eset__subset___24a3(X3,X4,X1)|~t(X2,X3)|~p(happ(X4,X2)))). % 0.30/0.57 cnf(i_0_18, plain, (cHahnSets_2eset__subset___24a3(X1,X2,X3)|p(happ(X2,esk5_3(X1,X2,X3))))). % 0.30/0.57 cnf(i_0_48, plain, (t(esk9_2(X1,X2),X1)|~c_24__type__36___24t(X1,X2)|~t(X3,X1)|~cType___24t(X1)|~p(happ(X2,X3)))). % 0.30/0.57 cnf(i_0_16, plain, (cProp___24t(happ(happ(happ(X1,X2),X3),X4))|~c_24__type__32360___24t(X1)|~c_24__type__36___24t(X2,X4)|~c_24__type__36___24t(X2,X3)|~cType___24t(X2))). % 0.30/0.57 cnf(i_0_43, plain, (p(happ(X1,X2))|~c_24__type__36___24t(X3,X1)|~t(X2,X3)|~cType___24t(X3)|~p(happ(X1,esk7_2(X3,X1))))). % 0.30/0.57 cnf(i_0_45, plain, (p(happ(X1,X2))|~c_24__type__36___24t(X3,X1)|~t(X2,X3)|~cType___24t(X3)|~p(happ(X1,esk8_2(X3,X1))))). % 0.30/0.57 cnf(i_0_47, plain, (p(happ(X1,esk9_2(X2,X1)))|~c_24__type__36___24t(X2,X1)|~t(X3,X2)|~cType___24t(X2)|~p(happ(X1,X3)))). % 0.30/0.57 cnf(i_0_44, plain, (t(esk7_2(X1,X2),X1)|p(happ(X2,X3))|~c_24__type__36___24t(X1,X2)|~t(X3,X1)|~cType___24t(X1))). % 0.30/0.57 cnf(i_0_46, plain, (t(esk8_2(X1,X2),X1)|p(happ(X2,X3))|~c_24__type__36___24t(X1,X2)|~t(X3,X1)|~cType___24t(X1))). % 0.30/0.57 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.30/0.57 # Begin printing tableau % 0.30/0.57 # Found 4 steps % 0.30/0.57 cnf(i_0_1, negated_conjecture, (~cCoq_2eRelations_2eRelation__Definitions_2ereflexive___24a2(c_24__type__35378,happ(cHahnSets_2eset__subset,cA))), inference(start_rule)). % 0.30/0.57 cnf(i_0_49, plain, (~cCoq_2eRelations_2eRelation__Definitions_2ereflexive___24a2(c_24__type__35378,happ(cHahnSets_2eset__subset,cA))), inference(extension_rule, [i_0_2])). % 0.30/0.57 cnf(i_0_71, plain, (~p(happ(happ(happ(cHahnSets_2eset__subset,cA),esk1_2(c_24__type__35378,happ(cHahnSets_2eset__subset,cA))),esk1_2(c_24__type__35378,happ(cHahnSets_2eset__subset,cA))))), inference(extension_rule, [i_0_10])). % 0.30/0.57 cnf(i_0_144, plain, (~cHahnSets_2eset__subset___24a3(cA,esk1_2(c_24__type__35378,happ(cHahnSets_2eset__subset,cA)),esk1_2(c_24__type__35378,happ(cHahnSets_2eset__subset,cA)))), inference(etableau_closure_rule, [i_0_144, ...])). % 0.30/0.57 # End printing tableau % 0.30/0.57 # SZS output end % 0.30/0.57 # Branches closed with saturation will be marked with an "s" % 0.30/0.57 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux. % 0.30/0.57 # We now have 2 tableaux to operate on % 0.30/0.57 # Found closed tableau during pool population. % 0.30/0.57 # Proof search is over... % 0.30/0.57 # Freeing feature tree %------------------------------------------------------------------------------