%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU166+1 : TPTP v8.1.0. Released v3.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 : n024.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 : Tue Jul 19 09:24:24 EDT 2022 % Result : Theorem 2.48s 2.71s % Output : CNFRefutation 2.48s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SEU166+1 : TPTP v8.1.0. Released v3.3.0. % 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.34 % Computer : n024.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 : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Sun Jun 19 06:06:47 EDT 2022 % 0.14/0.35 % CPUTime : % 0.20/0.38 # No SInE strategy applied % 0.20/0.38 # Auto-Mode selected heuristic G_E___208_B07_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.20/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.38 # % 0.20/0.38 # Presaturation interreduction done % 0.20/0.38 # Number of axioms: 19 Number of unprocessed: 19 % 0.20/0.38 # Tableaux proof search. % 0.20/0.38 # APR header successfully linked. % 0.20/0.38 # Hello from C++ % 0.20/0.40 # The folding up rule is enabled... % 0.20/0.40 # Local unification is enabled... % 0.20/0.40 # Any saturation attempts will use folding labels... % 0.20/0.40 # 19 beginning clauses after preprocessing and clausification % 0.20/0.40 # Creating start rules for all 2 conjectures. % 0.20/0.40 # There are 2 start rule candidates: % 0.20/0.40 # Found 6 unit axioms. % 0.20/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.40 # 2 start rule tableaux created. % 0.20/0.40 # 13 extension rule candidate clauses % 0.20/0.40 # 6 unit axiom clauses % 0.20/0.40 % 0.20/0.40 # Requested 8, 32 cores available to the main process. % 0.20/0.40 # There are not enough tableaux to fork, creating more from the initial 2 % 2.44/2.63 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux. % 2.44/2.63 # We now have 13 tableaux to operate on % 2.48/2.71 # Creating equality axioms % 2.48/2.71 # Ran out of tableaux, making start rules for all clauses % 2.48/2.71 # There were 8 total branch saturation attempts. % 2.48/2.71 # There were 2 of these attempts blocked. % 2.48/2.71 # There were 0 deferred branch saturation attempts. % 2.48/2.71 # There were 2 free duplicated saturations. % 2.48/2.71 # There were 5 total successful branch saturations. % 2.48/2.71 # There were 0 successful branch saturations in interreduction. % 2.48/2.71 # There were 0 successful branch saturations on the branch. % 2.48/2.71 # There were 3 successful branch saturations after the branch. % 2.48/2.71 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.48/2.71 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.48/2.71 # Begin clausification derivation % 2.48/2.71 % 2.48/2.71 # End clausification derivation % 2.48/2.71 # Begin listing active clauses obtained from FOF to CNF conversion % 2.48/2.71 cnf(i_0_24, negated_conjecture, (subset(esk9_0,esk10_0))). % 2.48/2.71 cnf(i_0_20, plain, (empty(esk7_0))). % 2.48/2.71 cnf(i_0_22, plain, (subset(X1,X1))). % 2.48/2.71 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 2.48/2.71 cnf(i_0_21, plain, (~empty(esk8_0))). % 2.48/2.71 cnf(i_0_19, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))). % 2.48/2.71 cnf(i_0_23, negated_conjecture, (~subset(cartesian_product2(esk9_0,esk11_0),cartesian_product2(esk10_0,esk11_0))|~subset(cartesian_product2(esk11_0,esk9_0),cartesian_product2(esk11_0,esk10_0)))). % 2.48/2.71 cnf(i_0_12, plain, (subset(X1,X2)|in(esk6_2(X1,X2),X1))). % 2.48/2.71 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 2.48/2.71 cnf(i_0_11, plain, (subset(X1,X2)|~in(esk6_2(X1,X2),X2))). % 2.48/2.71 cnf(i_0_13, plain, (in(X1,X2)|~subset(X3,X2)|~in(X1,X3))). % 2.48/2.71 cnf(i_0_10, plain, (in(esk1_4(X1,X2,cartesian_product2(X1,X2),X3),X1)|~in(X3,cartesian_product2(X1,X2)))). % 2.48/2.71 cnf(i_0_9, plain, (in(esk2_4(X1,X2,cartesian_product2(X1,X2),X3),X2)|~in(X3,cartesian_product2(X1,X2)))). % 2.48/2.71 cnf(i_0_5, plain, (X1=cartesian_product2(X2,X3)|in(esk4_3(X2,X3,X1),X2)|in(esk3_3(X2,X3,X1),X1))). % 2.48/2.71 cnf(i_0_4, plain, (X1=cartesian_product2(X2,X3)|in(esk5_3(X2,X3,X1),X3)|in(esk3_3(X2,X3,X1),X1))). % 2.48/2.71 cnf(i_0_7, plain, (in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3))). % 2.48/2.71 cnf(i_0_6, plain, (X1=cartesian_product2(X2,X3)|esk3_3(X2,X3,X1)!=unordered_pair(unordered_pair(X4,X5),singleton(X4))|~in(esk3_3(X2,X3,X1),X1)|~in(X5,X3)|~in(X4,X2))). % 2.48/2.71 cnf(i_0_3, plain, (unordered_pair(singleton(esk4_3(X1,X2,X3)),unordered_pair(esk4_3(X1,X2,X3),esk5_3(X1,X2,X3)))=esk3_3(X1,X2,X3)|X3=cartesian_product2(X1,X2)|in(esk3_3(X1,X2,X3),X3))). % 2.48/2.71 cnf(i_0_8, plain, (unordered_pair(singleton(esk1_4(X1,X2,cartesian_product2(X1,X2),X3)),unordered_pair(esk1_4(X1,X2,cartesian_product2(X1,X2),X3),esk2_4(X1,X2,cartesian_product2(X1,X2),X3)))=X3|~in(X3,cartesian_product2(X1,X2)))). % 2.48/2.71 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 2.48/2.71 # Begin printing tableau % 2.48/2.71 # Found 5 steps % 2.48/2.71 cnf(i_0_23, negated_conjecture, (~subset(cartesian_product2(esk9_0,esk11_0),cartesian_product2(esk10_0,esk11_0))|~subset(cartesian_product2(esk11_0,esk9_0),cartesian_product2(esk11_0,esk10_0))), inference(start_rule)). % 2.48/2.71 cnf(i_0_31, plain, (~subset(cartesian_product2(esk11_0,esk9_0),cartesian_product2(esk11_0,esk10_0))), inference(extension_rule, [i_0_12])). % 2.48/2.71 cnf(i_0_68, plain, (in(esk6_2(cartesian_product2(esk11_0,esk9_0),cartesian_product2(esk11_0,esk10_0)),cartesian_product2(esk11_0,esk9_0))), inference(extension_rule, [i_0_1])). % 2.48/2.71 cnf(i_0_30, plain, (~subset(cartesian_product2(esk9_0,esk11_0),cartesian_product2(esk10_0,esk11_0))), inference(etableau_closure_rule, [i_0_30, ...])). % 2.48/2.71 cnf(i_0_101370, plain, (~in(cartesian_product2(esk11_0,esk9_0),esk6_2(cartesian_product2(esk11_0,esk9_0),cartesian_product2(esk11_0,esk10_0)))), inference(etableau_closure_rule, [i_0_101370, ...])). % 2.48/2.71 # End printing tableau % 2.48/2.71 # SZS output end % 2.48/2.71 # Branches closed with saturation will be marked with an "s" % 2.48/2.72 # Creating equality axioms % 2.48/2.72 # Ran out of tableaux, making start rules for all clauses % 2.48/2.73 # Child (27193) has found a proof. % 2.48/2.73 % 2.48/2.73 # Proof search is over... % 2.48/2.73 # Freeing feature tree %------------------------------------------------------------------------------