%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET638+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 01:01:38 EDT 2022 % Result : Theorem 0.20s 0.39s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SET638+3 : TPTP v8.1.0. Released v2.2.0. % 0.07/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 : n008.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 Jul 10 23:53:38 EDT 2022 % 0.14/0.34 % CPUTime : % 0.14/0.37 # No SInE strategy applied % 0.14/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b % 0.14/0.37 # and selection function SelectCQIPrecW. % 0.14/0.37 # % 0.14/0.37 # Presaturation interreduction done % 0.14/0.37 # Number of axioms: 27 Number of unprocessed: 25 % 0.14/0.37 # Tableaux proof search. % 0.14/0.37 # APR header successfully linked. % 0.14/0.37 # 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 # 25 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 10 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 # 15 extension rule candidate clauses % 0.20/0.38 # 10 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.39 # There were 4 total branch saturation attempts. % 0.20/0.39 # There were 0 of these attempts blocked. % 0.20/0.39 # There were 0 deferred branch saturation attempts. % 0.20/0.39 # There were 2 free duplicated saturations. % 0.20/0.39 # There were 4 total successful branch saturations. % 0.20/0.39 # There were 0 successful branch saturations in interreduction. % 0.20/0.39 # There were 0 successful branch saturations on the branch. % 0.20/0.39 # There were 2 successful branch saturations after the branch. % 0.20/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # Begin clausification derivation % 0.20/0.39 % 0.20/0.39 # End clausification derivation % 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.39 cnf(i_0_28, negated_conjecture, (intersection(esk4_0,esk6_0)=empty_set)). % 0.20/0.39 cnf(i_0_3, plain, (union(X1,empty_set)=X1)). % 0.20/0.39 cnf(i_0_20, plain, (subset(X1,X1))). % 0.20/0.39 cnf(i_0_1, plain, (subset(intersection(X1,X2),X1))). % 0.20/0.39 cnf(i_0_29, negated_conjecture, (subset(esk4_0,union(esk6_0,esk5_0)))). % 0.20/0.39 cnf(i_0_4, plain, (union(intersection(X1,X2),intersection(X1,X3))=intersection(X1,union(X2,X3)))). % 0.20/0.39 cnf(i_0_19, plain, (intersection(X1,X2)=intersection(X2,X1))). % 0.20/0.39 cnf(i_0_18, plain, (union(X1,X2)=union(X2,X1))). % 0.20/0.39 cnf(i_0_27, negated_conjecture, (~subset(esk4_0,esk5_0))). % 0.20/0.39 cnf(i_0_8, plain, (~member(X1,empty_set))). % 0.20/0.39 cnf(i_0_22, plain, (~empty(X1)|~member(X2,X1))). % 0.20/0.39 cnf(i_0_15, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))). % 0.20/0.39 cnf(i_0_10, plain, (member(X1,X2)|~member(X1,intersection(X3,X2)))). % 0.20/0.39 cnf(i_0_2, plain, (intersection(X1,X2)=X1|~subset(X1,X2))). % 0.20/0.39 cnf(i_0_21, plain, (empty(X1)|member(esk2_1(X1),X1))). % 0.20/0.39 cnf(i_0_5, plain, (member(X1,union(X2,X3))|~member(X1,X3))). % 0.20/0.39 cnf(i_0_11, plain, (member(X1,X2)|~member(X1,intersection(X2,X3)))). % 0.20/0.39 cnf(i_0_12, plain, (subset(X1,X2)|~member(esk1_2(X1,X2),X2))). % 0.20/0.39 cnf(i_0_14, plain, (member(X1,X2)|~member(X1,X3)|~subset(X3,X2))). % 0.20/0.39 cnf(i_0_6, plain, (member(X1,union(X2,X3))|~member(X1,X2))). % 0.20/0.39 cnf(i_0_13, plain, (member(esk1_2(X1,X2),X1)|subset(X1,X2))). % 0.20/0.39 cnf(i_0_7, plain, (member(X1,X2)|member(X1,X3)|~member(X1,union(X2,X3)))). % 0.20/0.39 cnf(i_0_9, plain, (member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2))). % 0.20/0.39 cnf(i_0_24, plain, (X1=X2|~member(esk3_2(X1,X2),X2)|~member(esk3_2(X1,X2),X1))). % 0.20/0.39 cnf(i_0_23, plain, (X1=X2|member(esk3_2(X1,X2),X1)|member(esk3_2(X1,X2),X2))). % 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.39 # Begin printing tableau % 0.20/0.39 # Found 6 steps % 0.20/0.39 cnf(i_0_29, negated_conjecture, (subset(esk4_0,union(esk6_0,esk5_0))), inference(start_rule)). % 0.20/0.39 cnf(i_0_33, plain, (subset(esk4_0,union(esk6_0,esk5_0))), inference(extension_rule, [i_0_14])). % 0.20/0.39 cnf(i_0_88, plain, (member(esk3_2(union(esk6_0,esk5_0),union(esk6_0,esk5_0)),union(esk6_0,esk5_0))), inference(extension_rule, [i_0_24])). % 0.20/0.39 cnf(i_0_174, plain, (~member(esk3_2(union(esk6_0,esk5_0),union(esk6_0,esk5_0)),union(esk6_0,esk5_0))), inference(closure_rule, [i_0_88])). % 0.20/0.39 cnf(i_0_89, plain, (~member(esk3_2(union(esk6_0,esk5_0),union(esk6_0,esk5_0)),esk4_0)), inference(etableau_closure_rule, [i_0_89, ...])). % 0.20/0.39 cnf(i_0_173, plain, (union(esk6_0,esk5_0)=union(esk6_0,esk5_0)), inference(etableau_closure_rule, [i_0_173, ...])). % 0.20/0.39 # End printing tableau % 0.20/0.39 # SZS output end % 0.20/0.39 # Branches closed with saturation will be marked with an "s" % 0.20/0.39 # Returning from population with 15 new_tableaux and 0 remaining starting tableaux. % 0.20/0.39 # We now have 15 tableaux to operate on % 0.20/0.39 # Found closed tableau during pool population. % 0.20/0.39 # Proof search is over... % 0.20/0.39 # Freeing feature tree %------------------------------------------------------------------------------