%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET201+3 : TPTP v8.1.0. Released v2.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 00:58:50 EDT 2022 % Result : Theorem 0.18s 0.43s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.11 % Problem : SET201+3 : TPTP v8.1.0. Released v2.2.0. % 0.06/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.11/0.33 % Computer : n008.cluster.edu % 0.11/0.33 % Model : x86_64 x86_64 % 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.33 % Memory : 8042.1875MB % 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.33 % CPULimit : 300 % 0.11/0.33 % WCLimit : 600 % 0.11/0.33 % DateTime : Sat Jul 9 18:45:53 EDT 2022 % 0.11/0.33 % CPUTime : % 0.11/0.36 # No SInE strategy applied % 0.11/0.36 # Auto-Mode selected heuristic G_____0017_C18_F1_SE_CS_SP_S4Y % 0.11/0.36 # and selection function SelectMaxLComplexAPPNTNp. % 0.11/0.36 # % 0.11/0.36 # Number of axioms: 13 Number of unprocessed: 13 % 0.11/0.36 # Tableaux proof search. % 0.11/0.36 # APR header successfully linked. % 0.11/0.36 # Hello from C++ % 0.18/0.39 # The folding up rule is enabled... % 0.18/0.39 # Local unification is enabled... % 0.18/0.39 # Any saturation attempts will use folding labels... % 0.18/0.39 # 13 beginning clauses after preprocessing and clausification % 0.18/0.39 # Creating start rules for all 3 conjectures. % 0.18/0.39 # There are 3 start rule candidates: % 0.18/0.39 # Found 5 unit axioms. % 0.18/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.18/0.39 # 3 start rule tableaux created. % 0.18/0.39 # 8 extension rule candidate clauses % 0.18/0.39 # 5 unit axiom clauses % 0.18/0.39 % 0.18/0.39 # Requested 8, 32 cores available to the main process. % 0.18/0.39 # There are not enough tableaux to fork, creating more from the initial 3 % 0.18/0.43 # There were 4 total branch saturation attempts. % 0.18/0.43 # There were 0 of these attempts blocked. % 0.18/0.43 # There were 0 deferred branch saturation attempts. % 0.18/0.43 # There were 2 free duplicated saturations. % 0.18/0.43 # There were 4 total successful branch saturations. % 0.18/0.43 # There were 0 successful branch saturations in interreduction. % 0.18/0.43 # There were 0 successful branch saturations on the branch. % 0.18/0.43 # There were 2 successful branch saturations after the branch. % 0.18/0.43 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.43 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.43 # Begin clausification derivation % 0.18/0.43 % 0.18/0.43 # End clausification derivation % 0.18/0.43 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.43 cnf(i_0_15, negated_conjecture, (subset(esk3_0,esk4_0))). % 0.18/0.43 cnf(i_0_14, negated_conjecture, (subset(esk5_0,esk6_0))). % 0.18/0.43 cnf(i_0_8, plain, (subset(X1,X1))). % 0.18/0.43 cnf(i_0_7, plain, (intersection(X1,X2)=intersection(X2,X1))). % 0.18/0.43 cnf(i_0_5, plain, (subset(X1,X2)|member(esk1_2(X1,X2),X1))). % 0.18/0.43 cnf(i_0_6, plain, (member(X3,X2)|~member(X3,X1)|~subset(X1,X2))). % 0.18/0.43 cnf(i_0_2, plain, (member(X1,X2)|~member(X1,intersection(X3,X2)))). % 0.18/0.43 cnf(i_0_3, plain, (member(X1,X2)|~member(X1,intersection(X2,X3)))). % 0.18/0.43 cnf(i_0_4, plain, (subset(X1,X2)|~member(esk1_2(X1,X2),X2))). % 0.18/0.43 cnf(i_0_9, plain, (X1=X2|member(esk2_2(X1,X2),X2)|member(esk2_2(X1,X2),X1))). % 0.18/0.43 cnf(i_0_13, negated_conjecture, (~subset(intersection(esk3_0,esk5_0),intersection(esk4_0,esk6_0)))). % 0.18/0.43 cnf(i_0_1, plain, (member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2))). % 0.18/0.43 cnf(i_0_10, plain, (X1=X2|~member(esk2_2(X1,X2),X2)|~member(esk2_2(X1,X2),X1))). % 0.18/0.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.43 # Begin printing tableau % 0.18/0.43 # Found 6 steps % 0.18/0.43 cnf(i_0_15, negated_conjecture, (subset(esk3_0,esk4_0)), inference(start_rule)). % 0.18/0.43 cnf(i_0_18, plain, (subset(esk3_0,esk4_0)), inference(extension_rule, [i_0_6])). % 0.18/0.43 cnf(i_0_61, plain, (member(esk2_2(esk4_0,esk4_0),esk4_0)), inference(extension_rule, [i_0_10])). % 0.18/0.43 cnf(i_0_97, plain, (~member(esk2_2(esk4_0,esk4_0),esk4_0)), inference(closure_rule, [i_0_61])). % 0.18/0.43 cnf(i_0_62, plain, (~member(esk2_2(esk4_0,esk4_0),esk3_0)), inference(etableau_closure_rule, [i_0_62, ...])). % 0.18/0.43 cnf(i_0_96, plain, (esk4_0=esk4_0), inference(etableau_closure_rule, [i_0_96, ...])). % 0.18/0.43 # End printing tableau % 0.18/0.43 # SZS output end % 0.18/0.43 # Branches closed with saturation will be marked with an "s" % 0.18/0.43 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux. % 0.18/0.43 # We now have 9 tableaux to operate on % 0.18/0.43 # Found closed tableau during pool population. % 0.18/0.43 # Proof search is over... % 0.18/0.43 # Freeing feature tree %------------------------------------------------------------------------------