%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET951+1 : TPTP v8.1.0. Released v3.2.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 : n003.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 01:04:04 EDT 2022 % Result : Theorem 51.84s 6.86s % Output : CNFRefutation 51.84s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : SET951+1 : TPTP v8.1.0. Released v3.2.0. % 0.00/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n003.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 : Sat Jul 9 23:49:14 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.36 # No SInE strategy applied % 0.18/0.36 # Auto-Mode selected heuristic G_E___300_C01_F1_SE_CS_SP_S0Y % 0.18/0.36 # and selection function SelectMaxLComplexAvoidPosPred. % 0.18/0.36 # % 0.18/0.36 # Number of axioms: 25 Number of unprocessed: 25 % 0.18/0.36 # Tableaux proof search. % 0.18/0.36 # APR header successfully linked. % 0.18/0.36 # Hello from C++ % 0.18/0.36 # The folding up rule is enabled... % 0.18/0.36 # Local unification is enabled... % 0.18/0.36 # Any saturation attempts will use folding labels... % 0.18/0.36 # 25 beginning clauses after preprocessing and clausification % 0.18/0.36 # Creating start rules for all 2 conjectures. % 0.18/0.36 # There are 2 start rule candidates: % 0.18/0.36 # Found 7 unit axioms. % 0.18/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.18/0.36 # 2 start rule tableaux created. % 0.18/0.36 # 18 extension rule candidate clauses % 0.18/0.36 # 7 unit axiom clauses % 0.18/0.36 % 0.18/0.36 # Requested 8, 32 cores available to the main process. % 0.18/0.36 # There are not enough tableaux to fork, creating more from the initial 2 % 0.18/0.36 # Returning from population with 19 new_tableaux and 0 remaining starting tableaux. % 0.18/0.36 # We now have 19 tableaux to operate on % 51.84/6.86 # There were 3 total branch saturation attempts. % 51.84/6.86 # There were 0 of these attempts blocked. % 51.84/6.86 # There were 0 deferred branch saturation attempts. % 51.84/6.86 # There were 0 free duplicated saturations. % 51.84/6.86 # There were 1 total successful branch saturations. % 51.84/6.86 # There were 0 successful branch saturations in interreduction. % 51.84/6.86 # There were 0 successful branch saturations on the branch. % 51.84/6.86 # There were 1 successful branch saturations after the branch. % 51.84/6.86 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 51.84/6.86 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 51.84/6.86 # Begin clausification derivation % 51.84/6.86 % 51.84/6.86 # End clausification derivation % 51.84/6.86 # Begin listing active clauses obtained from FOF to CNF conversion % 51.84/6.86 cnf(i_0_21, plain, (empty(esk7_0))). % 51.84/6.86 cnf(i_0_22, plain, (~empty(esk8_0))). % 51.84/6.86 cnf(i_0_20, plain, (set_intersection2(X1,X1)=X1)). % 51.84/6.86 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 51.84/6.86 cnf(i_0_3, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))). % 51.84/6.86 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))). % 51.84/6.86 cnf(i_0_16, plain, (in(X1,X2)|X3!=set_intersection2(X4,X2)|~in(X1,X3))). % 51.84/6.86 cnf(i_0_17, plain, (in(X1,X2)|X3!=set_intersection2(X2,X4)|~in(X1,X3))). % 51.84/6.86 cnf(i_0_15, plain, (in(X1,X4)|X4!=set_intersection2(X2,X3)|~in(X1,X3)|~in(X1,X2))). % 51.84/6.86 cnf(i_0_24, negated_conjecture, (in(esk9_0,set_intersection2(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk12_0,esk13_0))))). % 51.84/6.86 cnf(i_0_25, plain, (X1=X2|unordered_pair(unordered_pair(X3,X1),singleton(X3))!=unordered_pair(unordered_pair(X4,X2),singleton(X4)))). % 51.84/6.86 cnf(i_0_26, plain, (X1=X2|unordered_pair(unordered_pair(X1,X3),singleton(X1))!=unordered_pair(unordered_pair(X2,X4),singleton(X2)))). % 51.84/6.86 cnf(i_0_19, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))). % 51.84/6.86 cnf(i_0_8, plain, (in(X5,X6)|X6!=cartesian_product2(X2,X4)|X5!=unordered_pair(unordered_pair(X1,X3),singleton(X1))|~in(X3,X4)|~in(X1,X2))). % 51.84/6.86 cnf(i_0_23, negated_conjecture, (unordered_pair(unordered_pair(X1,X2),singleton(X1))!=esk9_0|~in(X2,set_intersection2(esk11_0,esk13_0))|~in(X1,set_intersection2(esk10_0,esk12_0)))). % 51.84/6.86 cnf(i_0_12, plain, (X3=set_intersection2(X1,X2)|in(esk6_3(X1,X2,X3),X3)|in(esk6_3(X1,X2,X3),X2))). % 51.84/6.86 cnf(i_0_13, plain, (X3=set_intersection2(X1,X2)|in(esk6_3(X1,X2,X3),X3)|in(esk6_3(X1,X2,X3),X1))). % 51.84/6.86 cnf(i_0_6, plain, (X3=cartesian_product2(X1,X2)|in(esk3_3(X1,X2,X3),X3)|in(esk4_3(X1,X2,X3),X1))). % 51.84/6.86 cnf(i_0_5, plain, (X3=cartesian_product2(X1,X2)|in(esk3_3(X1,X2,X3),X3)|in(esk5_3(X1,X2,X3),X2))). % 51.84/6.86 cnf(i_0_7, plain, (X3=cartesian_product2(X1,X2)|esk3_3(X1,X2,X3)!=unordered_pair(unordered_pair(X4,X5),singleton(X4))|~in(X5,X2)|~in(X4,X1)|~in(esk3_3(X1,X2,X3),X3))). % 51.84/6.86 cnf(i_0_11, plain, (in(esk1_4(X1,X2,X3,X4),X1)|X3!=cartesian_product2(X1,X2)|~in(X4,X3))). % 51.84/6.86 cnf(i_0_10, plain, (in(esk2_4(X1,X2,X3,X4),X2)|X3!=cartesian_product2(X1,X2)|~in(X4,X3))). % 51.84/6.86 cnf(i_0_14, plain, (X3=set_intersection2(X1,X2)|~in(esk6_3(X1,X2,X3),X3)|~in(esk6_3(X1,X2,X3),X2)|~in(esk6_3(X1,X2,X3),X1))). % 51.84/6.86 cnf(i_0_4, plain, (X3=cartesian_product2(X1,X2)|unordered_pair(unordered_pair(esk4_3(X1,X2,X3),esk5_3(X1,X2,X3)),singleton(esk4_3(X1,X2,X3)))=esk3_3(X1,X2,X3)|in(esk3_3(X1,X2,X3),X3))). % 51.84/6.86 cnf(i_0_9, plain, (unordered_pair(unordered_pair(esk1_4(X2,X3,X4,X1),esk2_4(X2,X3,X4,X1)),singleton(esk1_4(X2,X3,X4,X1)))=X1|X4!=cartesian_product2(X2,X3)|~in(X1,X4))). % 51.84/6.86 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 51.84/6.86 # Begin printing tableau % 51.84/6.86 # Found 7 steps % 51.84/6.86 cnf(i_0_24, negated_conjecture, (in(esk9_0,set_intersection2(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk12_0,esk13_0)))), inference(start_rule)). % 51.84/6.86 cnf(i_0_30, plain, (in(esk9_0,set_intersection2(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk12_0,esk13_0)))), inference(extension_rule, [i_0_1])). % 51.84/6.86 cnf(i_0_146, plain, (~in(set_intersection2(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk12_0,esk13_0)),esk9_0)), inference(extension_rule, [i_0_16])). % 51.84/6.86 cnf(i_0_148, plain, (set_intersection2(set_intersection2(X4,esk9_0),set_intersection2(X4,esk9_0))!=set_intersection2(X4,esk9_0)), inference(closure_rule, [i_0_20])). % 51.84/6.86 cnf(i_0_149, plain, (~in(set_intersection2(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk12_0,esk13_0)),set_intersection2(set_intersection2(X4,esk9_0),set_intersection2(X4,esk9_0)))), inference(extension_rule, [i_0_16])). % 51.84/6.86 cnf(i_0_319594, plain, (set_intersection2(set_intersection2(X5,set_intersection2(set_intersection2(X4,esk9_0),set_intersection2(X4,esk9_0))),set_intersection2(X5,set_intersection2(set_intersection2(X4,esk9_0),set_intersection2(X4,esk9_0))))!=set_intersection2(X5,set_intersection2(set_intersection2(X4,esk9_0),set_intersection2(X4,esk9_0)))), inference(closure_rule, [i_0_20])). % 51.84/6.86 cnf(i_0_319595, plain, (~in(set_intersection2(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk12_0,esk13_0)),set_intersection2(set_intersection2(X5,set_intersection2(set_intersection2(X4,esk9_0),set_intersection2(X4,esk9_0))),set_intersection2(X5,set_intersection2(set_intersection2(X4,esk9_0),set_intersection2(X4,esk9_0)))))), inference(etableau_closure_rule, [i_0_319595, ...])). % 51.84/6.86 # End printing tableau % 51.84/6.86 # SZS output end % 51.84/6.86 # Branches closed with saturation will be marked with an "s" % 51.84/6.87 # Child (25189) has found a proof. % 51.84/6.87 % 51.84/6.87 # Proof search is over... % 51.84/6.87 # Freeing feature tree %------------------------------------------------------------------------------