%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET983+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 : n015.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:15 EDT 2022 % Result : Theorem 0.12s 0.37s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.11 % Problem : SET983+1 : TPTP v8.1.0. Released v3.2.0. % 0.10/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 : n015.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 : Sun Jul 10 15:22:23 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 15 Number of unprocessed: 15 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 15 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 3 conjectures. % 0.12/0.36 # There are 3 start rule candidates: % 0.12/0.36 # Found 8 unit axioms. % 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.36 # 3 start rule tableaux created. % 0.12/0.36 # 7 extension rule candidate clauses % 0.12/0.36 # 8 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 3 % 0.12/0.36 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 0.12/0.36 # We now have 10 tableaux to operate on % 0.12/0.37 # There were 1 total branch saturation attempts. % 0.12/0.37 # There were 0 of these attempts blocked. % 0.12/0.37 # There were 0 deferred branch saturation attempts. % 0.12/0.37 # There were 0 free duplicated saturations. % 0.12/0.37 # There were 1 total successful branch saturations. % 0.12/0.37 # There were 1 successful branch saturations in interreduction. % 0.12/0.37 # There were 0 successful branch saturations on the branch. % 0.12/0.37 # There were 0 successful branch saturations after the branch. % 0.12/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.37 # Begin clausification derivation % 0.12/0.37 % 0.12/0.37 # End clausification derivation % 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.37 cnf(i_0_10, plain, (empty(esk2_0))). % 0.12/0.37 cnf(i_0_15, negated_conjecture, (in(esk4_0,cartesian_product2(esk5_0,esk6_0)))). % 0.12/0.37 cnf(i_0_14, negated_conjecture, (in(esk4_0,cartesian_product2(esk7_0,esk8_0)))). % 0.12/0.37 cnf(i_0_9, plain, (set_intersection2(X1,X1)=X1)). % 0.12/0.37 cnf(i_0_12, plain, (set_intersection2(cartesian_product2(X1,X2),cartesian_product2(X3,X4))=cartesian_product2(set_intersection2(X1,X3),set_intersection2(X2,X4)))). % 0.12/0.37 cnf(i_0_2, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))). % 0.12/0.37 cnf(i_0_13, negated_conjecture, (~in(esk4_0,cartesian_product2(set_intersection2(esk5_0,esk7_0),set_intersection2(esk6_0,esk8_0))))). % 0.12/0.37 cnf(i_0_11, plain, (~empty(esk3_0))). % 0.12/0.37 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.12/0.37 cnf(i_0_7, plain, (in(X1,X2)|~in(X1,set_intersection2(X3,X2)))). % 0.12/0.37 cnf(i_0_8, plain, (in(X1,X2)|~in(X1,set_intersection2(X2,X3)))). % 0.12/0.37 cnf(i_0_6, plain, (in(X1,set_intersection2(X2,X3))|~in(X1,X3)|~in(X1,X2))). % 0.12/0.37 cnf(i_0_3, plain, (X1=set_intersection2(X2,X3)|in(esk1_3(X2,X3,X1),X3)|in(esk1_3(X2,X3,X1),X1))). % 0.12/0.37 cnf(i_0_4, plain, (X1=set_intersection2(X2,X3)|in(esk1_3(X2,X3,X1),X2)|in(esk1_3(X2,X3,X1),X1))). % 0.12/0.37 cnf(i_0_5, plain, (X1=set_intersection2(X2,X3)|~in(esk1_3(X2,X3,X1),X1)|~in(esk1_3(X2,X3,X1),X3)|~in(esk1_3(X2,X3,X1),X2))). % 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.37 # Begin printing tableau % 0.12/0.37 # Found 5 steps % 0.12/0.37 cnf(i_0_15, negated_conjecture, (in(esk4_0,cartesian_product2(esk5_0,esk6_0))), inference(start_rule)). % 0.12/0.37 cnf(i_0_21, plain, (in(esk4_0,cartesian_product2(esk5_0,esk6_0))), inference(extension_rule, [i_0_6])). % 0.12/0.37 cnf(i_0_67, plain, (~in(esk4_0,cartesian_product2(esk7_0,esk8_0))), inference(closure_rule, [i_0_14])). % 0.12/0.37 cnf(i_0_66, plain, (in(esk4_0,set_intersection2(cartesian_product2(esk5_0,esk6_0),cartesian_product2(esk7_0,esk8_0)))), inference(extension_rule, [i_0_1])). % 0.12/0.37 cnf(i_0_80, plain, (~in(set_intersection2(cartesian_product2(esk5_0,esk6_0),cartesian_product2(esk7_0,esk8_0)),esk4_0)), inference(etableau_closure_rule, [i_0_80, ...])). % 0.12/0.37 # End printing tableau % 0.12/0.37 # SZS output end % 0.12/0.37 # Branches closed with saturation will be marked with an "s" % 0.12/0.37 # There were 1 total branch saturation attempts. % 0.12/0.37 # There were 0 of these attempts blocked. % 0.12/0.37 # There were 0 deferred branch saturation attempts. % 0.12/0.37 # There were 0 free duplicated saturations. % 0.12/0.37 # There were 1 total successful branch saturations. % 0.12/0.37 # There were 1 successful branch saturations in interreduction. % 0.12/0.37 # There were 0 successful branch saturations on the branch. % 0.12/0.37 # There were 0 successful branch saturations after the branch. % 0.12/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.37 # Begin clausification derivation % 0.12/0.37 % 0.12/0.37 # End clausification derivation % 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.37 cnf(i_0_10, plain, (empty(esk2_0))). % 0.12/0.37 cnf(i_0_15, negated_conjecture, (in(esk4_0,cartesian_product2(esk5_0,esk6_0)))). % 0.12/0.37 cnf(i_0_14, negated_conjecture, (in(esk4_0,cartesian_product2(esk7_0,esk8_0)))). % 0.12/0.37 cnf(i_0_9, plain, (set_intersection2(X1,X1)=X1)). % 0.12/0.37 cnf(i_0_12, plain, (set_intersection2(cartesian_product2(X1,X2),cartesian_product2(X3,X4))=cartesian_product2(set_intersection2(X1,X3),set_intersection2(X2,X4)))). % 0.12/0.37 cnf(i_0_2, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))). % 0.12/0.37 cnf(i_0_13, negated_conjecture, (~in(esk4_0,cartesian_product2(set_intersection2(esk5_0,esk7_0),set_intersection2(esk6_0,esk8_0))))). % 0.12/0.37 cnf(i_0_11, plain, (~empty(esk3_0))). % 0.12/0.37 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.12/0.37 cnf(i_0_7, plain, (in(X1,X2)|~in(X1,set_intersection2(X3,X2)))). % 0.12/0.37 cnf(i_0_8, plain, (in(X1,X2)|~in(X1,set_intersection2(X2,X3)))). % 0.12/0.37 cnf(i_0_6, plain, (in(X1,set_intersection2(X2,X3))|~in(X1,X3)|~in(X1,X2))). % 0.12/0.37 cnf(i_0_3, plain, (X1=set_intersection2(X2,X3)|in(esk1_3(X2,X3,X1),X3)|in(esk1_3(X2,X3,X1),X1))). % 0.12/0.37 cnf(i_0_4, plain, (X1=set_intersection2(X2,X3)|in(esk1_3(X2,X3,X1),X2)|in(esk1_3(X2,X3,X1),X1))). % 0.12/0.37 cnf(i_0_5, plain, (X1=set_intersection2(X2,X3)|~in(esk1_3(X2,X3,X1),X1)|~in(esk1_3(X2,X3,X1),X3)|~in(esk1_3(X2,X3,X1),X2))). % 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.37 # Begin printing tableau % 0.12/0.37 # Found 5 steps % 0.12/0.37 cnf(i_0_15, negated_conjecture, (in(esk4_0,cartesian_product2(esk5_0,esk6_0))), inference(start_rule)). % 0.12/0.37 cnf(i_0_21, plain, (in(esk4_0,cartesian_product2(esk5_0,esk6_0))), inference(extension_rule, [i_0_6])). % 0.12/0.37 cnf(i_0_68, plain, (~in(esk4_0,cartesian_product2(esk7_0,esk8_0))), inference(closure_rule, [i_0_14])). % 0.12/0.37 cnf(i_0_66, plain, (in(esk4_0,set_intersection2(cartesian_product2(esk7_0,esk8_0),cartesian_product2(esk5_0,esk6_0)))), inference(extension_rule, [i_0_1])). % 0.12/0.37 cnf(i_0_80, plain, (~in(set_intersection2(cartesian_product2(esk7_0,esk8_0),cartesian_product2(esk5_0,esk6_0)),esk4_0)), inference(etableau_closure_rule, [i_0_80, ...])). % 0.12/0.37 # End printing tableau % 0.12/0.37 # SZS output end % 0.12/0.37 # Branches closed with saturation will be marked with an "s" % 0.12/0.37 # Child (14492) has found a proof. % 0.12/0.37 % 0.12/0.37 # Proof search is over... % 0.12/0.37 # Freeing feature tree %------------------------------------------------------------------------------