%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET971+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 : n008.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:11 EDT 2022 % Result : Theorem 0.20s 0.38s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.13 % Problem : SET971+1 : TPTP v8.1.0. Released v3.2.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.13/0.35 % Computer : n008.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Sun Jul 10 08:25:53 EDT 2022 % 0.13/0.35 % CPUTime : % 0.20/0.38 # No SInE strategy applied % 0.20/0.38 # Auto-Mode selected heuristic G_E___208_C18C___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: 10 Number of unprocessed: 10 % 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.38 # The folding up rule is enabled... % 0.20/0.38 # Local unification is enabled... % 0.20/0.38 # Any saturation attempts will use folding labels... % 0.20/0.38 # 10 beginning clauses after preprocessing and clausification % 0.20/0.38 # Creating start rules for all 3 conjectures. % 0.20/0.38 # There are 3 start rule candidates: % 0.20/0.38 # Found 9 unit axioms. % 0.20/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.38 # 3 start rule tableaux created. % 0.20/0.38 # 1 extension rule candidate clauses % 0.20/0.38 # 9 unit axiom clauses % 0.20/0.38 % 0.20/0.38 # Requested 8, 32 cores available to the main process. % 0.20/0.38 # There are not enough tableaux to fork, creating more from the initial 3 % 0.20/0.38 # Creating equality axioms % 0.20/0.38 # Ran out of tableaux, making start rules for all clauses % 0.20/0.38 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux. % 0.20/0.38 # We now have 12 tableaux to operate on % 0.20/0.38 # There were 1 total branch saturation attempts. % 0.20/0.38 # There were 0 of these attempts blocked. % 0.20/0.38 # There were 0 deferred branch saturation attempts. % 0.20/0.38 # There were 0 free duplicated saturations. % 0.20/0.38 # There were 1 total successful branch saturations. % 0.20/0.38 # There were 0 successful branch saturations in interreduction. % 0.20/0.38 # There were 0 successful branch saturations on the branch. % 0.20/0.38 # There were 1 successful branch saturations after the branch. % 0.20/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # Begin clausification derivation % 0.20/0.38 % 0.20/0.38 # End clausification derivation % 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.38 cnf(i_0_9, negated_conjecture, (subset(esk3_0,esk4_0))). % 0.20/0.38 cnf(i_0_8, negated_conjecture, (subset(esk5_0,esk6_0))). % 0.20/0.38 cnf(i_0_3, plain, (empty(esk1_0))). % 0.20/0.38 cnf(i_0_5, plain, (subset(X1,X1))). % 0.20/0.38 cnf(i_0_2, plain, (set_intersection2(X1,X1)=X1)). % 0.20/0.38 cnf(i_0_6, plain, (set_intersection2(cartesian_product2(X1,X2),cartesian_product2(X3,X4))=cartesian_product2(set_intersection2(X1,X3),set_intersection2(X2,X4)))). % 0.20/0.38 cnf(i_0_1, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))). % 0.20/0.38 cnf(i_0_4, plain, (~empty(esk2_0))). % 0.20/0.38 cnf(i_0_7, negated_conjecture, (cartesian_product2(set_intersection2(esk3_0,esk4_0),set_intersection2(esk5_0,esk6_0))!=cartesian_product2(esk3_0,esk5_0))). % 0.20/0.38 cnf(i_0_10, plain, (set_intersection2(X1,X2)=X1|~subset(X1,X2))). % 0.20/0.38 cnf(i_0_24, plain, (X21=X21)). % 0.20/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.38 # Begin printing tableau % 0.20/0.38 # Found 6 steps % 0.20/0.38 cnf(i_0_9, negated_conjecture, (subset(esk3_0,esk4_0)), inference(start_rule)). % 0.20/0.38 cnf(i_0_32, plain, (subset(esk3_0,esk4_0)), inference(extension_rule, [i_0_30])). % 0.20/0.38 cnf(i_0_60, plain, (set_intersection2(esk3_0,esk3_0)!=esk3_0), inference(closure_rule, [i_0_2])). % 0.20/0.38 cnf(i_0_61, plain, (set_intersection2(esk4_0,esk4_0)!=esk4_0), inference(closure_rule, [i_0_2])). % 0.20/0.38 cnf(i_0_59, plain, (subset(set_intersection2(esk3_0,esk3_0),set_intersection2(esk4_0,esk4_0))), inference(extension_rule, [i_0_10])). % 0.20/0.38 cnf(i_0_66, plain, (set_intersection2(set_intersection2(esk3_0,esk3_0),set_intersection2(esk4_0,esk4_0))=set_intersection2(esk3_0,esk3_0)), inference(etableau_closure_rule, [i_0_66, ...])). % 0.20/0.38 # End printing tableau % 0.20/0.38 # SZS output end % 0.20/0.38 # Branches closed with saturation will be marked with an "s" % 0.20/0.38 # There were 1 total branch saturation attempts. % 0.20/0.38 # There were 0 of these attempts blocked. % 0.20/0.38 # There were 0 deferred branch saturation attempts. % 0.20/0.38 # There were 0 free duplicated saturations. % 0.20/0.38 # There were 1 total successful branch saturations. % 0.20/0.38 # There were 0 successful branch saturations in interreduction. % 0.20/0.38 # There were 0 successful branch saturations on the branch. % 0.20/0.38 # There were 1 successful branch saturations after the branch. % 0.20/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # Begin clausification derivation % 0.20/0.38 % 0.20/0.38 # End clausification derivation % 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.38 cnf(i_0_9, negated_conjecture, (subset(esk3_0,esk4_0))). % 0.20/0.38 cnf(i_0_8, negated_conjecture, (subset(esk5_0,esk6_0))). % 0.20/0.38 cnf(i_0_3, plain, (empty(esk1_0))). % 0.20/0.38 cnf(i_0_5, plain, (subset(X1,X1))). % 0.20/0.38 cnf(i_0_2, plain, (set_intersection2(X1,X1)=X1)). % 0.20/0.38 cnf(i_0_6, plain, (set_intersection2(cartesian_product2(X1,X2),cartesian_product2(X3,X4))=cartesian_product2(set_intersection2(X1,X3),set_intersection2(X2,X4)))). % 0.20/0.38 cnf(i_0_1, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))). % 0.20/0.38 cnf(i_0_4, plain, (~empty(esk2_0))). % 0.20/0.38 cnf(i_0_7, negated_conjecture, (cartesian_product2(set_intersection2(esk3_0,esk4_0),set_intersection2(esk5_0,esk6_0))!=cartesian_product2(esk3_0,esk5_0))). % 0.20/0.38 cnf(i_0_10, plain, (set_intersection2(X1,X2)=X1|~subset(X1,X2))). % 0.20/0.38 cnf(i_0_24, plain, (X21=X21)). % 0.20/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.38 # Begin printing tableau % 0.20/0.38 # Found 5 steps % 0.20/0.38 cnf(i_0_9, negated_conjecture, (subset(esk3_0,esk4_0)), inference(start_rule)). % 0.20/0.38 cnf(i_0_32, plain, (subset(esk3_0,esk4_0)), inference(extension_rule, [i_0_10])). % 0.20/0.38 cnf(i_0_44, plain, (set_intersection2(esk3_0,esk4_0)=esk3_0), inference(extension_rule, [i_0_27])). % 0.20/0.38 cnf(i_0_74, plain, (esk3_0!=set_intersection2(esk3_0,esk3_0)), inference(closure_rule, [i_0_2])). % 0.20/0.38 cnf(i_0_72, plain, (set_intersection2(esk3_0,esk4_0)=set_intersection2(esk3_0,esk3_0)), inference(etableau_closure_rule, [i_0_72, ...])). % 0.20/0.38 # End printing tableau % 0.20/0.38 # SZS output end % 0.20/0.38 # Branches closed with saturation will be marked with an "s" % 0.20/0.38 # There were 1 total branch saturation attempts. % 0.20/0.38 # There were 0 of these attempts blocked. % 0.20/0.38 # There were 0 deferred branch saturation attempts. % 0.20/0.38 # There were 0 free duplicated saturations. % 0.20/0.38 # There were 1 total successful branch saturations. % 0.20/0.38 # There were 0 successful branch saturations in interreduction. % 0.20/0.38 # There were 0 successful branch saturations on the branch. % 0.20/0.38 # There were 1 successful branch saturations after the branch. % 0.20/0.38 # Child (20083) has found a proof. % 0.20/0.38 % 0.20/0.38 # There were 1 total branch saturation attempts. % 0.20/0.38 # There were 0 of these attempts blocked. % 0.20/0.38 # There were 0 deferred branch saturation attempts. % 0.20/0.38 # There were 0 free duplicated saturations. % 0.20/0.38 # There were 1 total successful branch saturations. % 0.20/0.38 # There were 0 successful branch saturations in interreduction. % 0.20/0.38 # There were 0 successful branch saturations on the branch. % 0.20/0.38 # There were 1 successful branch saturations after the branch. % 0.20/0.38 # Proof search is over... % 0.20/0.38 # Freeing feature tree %------------------------------------------------------------------------------